Interference Cancellation Based Detection for V-BLAST With Diversity Maximizing Channel Partition
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
Multiple-input multiple-output (MIMO) systems achieve very high bandwidth efficiencies through spatial multiplexing. However, the complexity of optimal detection in such systems motivates the need for more practical alternatives. Recently, a suboptimal lower complexity detection scheme called ¿generalized parallel interference cancellation¿ (GPIC), with close to optimal performance, was introduced. The reported performance of GPIC, however, was assessed by computer simulations only. In this paper, we show that with its original design, GPIC does not always provide close to optimal performance. Based on a diversity analysis of GPIC like techniques, we propose two new improved algorithms, referred to as Sel-MMSE and Sel-MMSE-OSIC, and derive sufficient conditions for achieving optimal performance asymptotically. We also provide a complexity analysis of these two schemes, and show that for large constellation sizes it is lower than the original GPIC. While still more complex than the fixed complexity sphere decoder by a factor in the range of 2-3 (for most configurations), our algorithms are also applicable to undetermined MIMO systems. Simulations results confirm that the new schemes provide maximal diversity gains. Furthermore, Sel-MMSE-OSIC provides a significant gain over Sel-MMSE, making its performance nearly indistinguishable from optimal for all signal-to-noise ratio (SNR) levels.
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