Two Novel Channel-Augmentation Schemes for MIMO Systems
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
Recently, Rankin, Taylor, and Martin (RTM) have proposed a simple channel-augmentation scheme for multiple-input multiple-output (MIMO) systems. They have shown that the virtual receive antennas created by repeating the same transmit symbols several times can improve the outage rate of slow MIMO fading channels, especially if the number of transmit antennas is smaller than the number of receive antennas. Inspired by the RTM paper, we propose in this paper two channel-augmentation schemes having the same low complexity as the RTM scheme. In the first, the transmitted symbols are both repeated and complex conjugated leading to the conjugate virtual antenna (CVA) scheme. In the second, the transmitted symbols are constrained to be real-valued leading to the real virtual antenna (RVA) scheme. We show that the RTM, CVA, and RVA schemes can achieve a higher outage rate than the baseline scheme without augmentation for both V-BLAST and D-BLAST. The novel RVA and CVA schemes are seen to be more robust to channel correlation than the RTM scheme.
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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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