Diversity Analysis and Design of Space–Time Multiblock Codes for MIMO Systems Equipped With Linear MMSE Receivers
Bibliographic record
Abstract
This paper addresses the problem of designing optimum full-symbol-rate linear space-time block codes (STBC) for a multi-input multi-output (MIMO) communication system with M transmitter and N ≥ M receiver antennas and a linear minimum mean square error (MMSE) receiver. By analyzing the detection error probability expression for the optimized STBC, it is shown that for QAM signaling, the maximum diversity gain for such a system is N - M + 1. The minimum probability of error STBC design is then extended to systems in which the transmission spans L independent realizations from a block fading channel model, and a (multiblock) linear MMSE receiver is employed. Necessary and sufficient conditions for the optimality of the code are obtained, and a systematic design method for generating codes that satisfy these conditions is presented. The detection error probability and diversity gain of this optimized linear multiblock transceiver are analyzed. It is proved that the error probability decreases with L, and it is shown numerically that the diversity gain increases with L. Thus, if the corresponding latency can be accommodated, for sufficiently large L an optimally designed multiblock system with a linear receiver can exploit the temporal diversity provided by the block-fading channel and achieve higher diversity gain than that of any single-block system of the same symbol rate with a maximum likelihood (ML) receiver. The optimized multiblock linear system achieves this diversity at a substantially lower computational cost. In fact, the structure of the optimal codes can be exploited to significantly reduce the cost of the multiblock linear receiver.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".