Asymptotic optimal detection for MIMO communication systems employing tree search with incremental channel partition preprocessing
Bibliographic record
Abstract
ABSTRACT The high complexity of optimal detection for spatial multplexing multiple‐input multiple‐output systems motivates the need for more practical alternatives. Among many suboptimal schemes reported in the literature, very few can be proven to provide close to optimal performance with low fixed complexity. The recently introduced Selection based Minimum Mean Square Error Ordered Successive Interference Cancellation (Sel‐MMSE‐OSIC) algorithm is one such scheme that employs list‐based detection. Simulations results showed that its performance is nearly indistinguishable from optimal at almost all signal‐to‐noise ratio (SNR) levels. In this paper, we propose an improved asymptotically optimal fixed‐complexity algorithm that provides substantial complexity reductions over Sel‐MMSE‐OSIC with similar error rate performance. This scheme is based on simplified channel partition and efficient tree‐based list detection. To achieve further reductions in complexity for large constellation sizes, a variable complexity version of this scheme is proposed. The resulting algorithm is a variable complexity scheme that operates on a very small subset of candidates and employs an improved channel partition preprocessing that not only reduces complexity but also guarantees high SNR optimality over space uncorrelated channels. Simulations results confirm that the proposed scheme provides significant complexity reductions over conventional variable complexity detection schemes. Copyright © 2012 John Wiley & Sons, Ltd.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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".