Full-Diversity Codes for MISO Systems Equipped With Linear or ML Detectors
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, a general criterion for space-time block codes (STBC) to achieve full diversity with a linear receiver is proposed for a wireless communication system having multiple transmitter and single receiver antennas [multiple-input-single-output (MISO)]. Particularly, the STBC with Toeplitz structure satisfies this criterion, and therefore, enables full diversity. Further examination of this Toeplitz STBC reveals the following important properties: (1) the symbol transmission rate can be made to approach unity; (2) applying the Toeplitz code to any signalling scheme having nonzero distance between the nearest constellation points results in a nonvanishing determinant. In addition, if quadratic-amplitude modulation (QAM) is used as the signalling scheme, then for independent MISO flat-fading channels, the Toeplitz codes is proved to approach the optimal diversity-versus-multiplexing tradeoff with a zero-forcing (ZF) receiver when the number of channel uses is large. This is, so far, the first nonorthogonal STBC shown to achieve the optimal tradeoff for such a receiver. On the other hand, when maximum-likelihood (ML) detection is employed in a MISO system, the Toeplitz STBC achieves the maximum coding gain for independent channels. When the channel fading coefficients are correlated, the inherent transmission matrix in the Toeplitz STBC can be designed to minimize the average worst case pairwise error probability.
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.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 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 it