Capacity Performance of Tensor Multi-Domain Communication Systems With Discrete Signalling Constellations
Bibliographic record
Abstract
Modern communication systems employ multi-domain modulation and coding techniques for effectively exploiting all available resources. Hence in such systems the transmit and receive signals have an inherent multi-domain structure which can be represented using tensors. This work considers the capacity of higher order tensor channels associated with such multi-domain communication systems when the elements of the input tensor are constrained to be drawn from discrete signalling constellations. We establish a relationship between the tensor gradient of the mutual information and the error covariance tensor associated with the minimum mean squared error estimator at the receiver. This relation is used to iteratively find a multi-linear precoder at the input which achieves capacity of the tensor channel under the signalling constellation constraints. Through numerical examples, we show the convergence behavior of the proposed precoder, and compare the capacity achieved under different constellations with the capacity when the input is Gaussian. Further, we exploit the tensor formulation of the problem to find the channel capacity under a variety of different power constraints spanning across several domains. At high SNR, the constellation constraints saturates the capacity while at low SNRs, the constellation constraints are not too relevant, and the power constraints dominate and limit the performance. The capacity saturation level depends on the input order and distribution.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.003 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".