Iterative Demodulation and Decoding Algorithm for 3GPP/LTE-A MIMO-OFDM Using Distribution Approximation
Bibliographic record
Abstract
Soft iterative detection/decoding algorithms are fundamentally necessary for multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) adopted in the Third Generation Long Term Evolution (LTE)-Advanced in order to increase the capacity and achieve high data rates. However, their high performance critically requires log likelihood ratio computations with prohibitive complexity. This challenge will be addressed in this paper. We first use the assumption of Gaussian transmit symbols to show the equivalence among several existing algorithms. We next develop a non-Gaussian approximation for high-order constellations, which paves the way for interference cancellation-based detectors. Based on both Gaussian and non-Gaussian approximations, we thus develop several capacity-achieving iterative MIMO-OFDM demodulation and decoding algorithms. To this end, we adopt K-best algorithms to take advantage of both the types of approximations and the list decoder. Unlike existing algorithms, our proposed K-best algorithms make use of the a priori probabilities to generate the list. Simulations of standard-compliant LTE systems demonstrate that the proposed algorithms outperform the existing ones.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.002 |
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".