Sphere Decoding for MIMO Systems with Newton Iterative Matrix Inversion
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
This work considers the application of Newton's iterative method of matrix inversion for reducing the complexity of calculating the unconstrained solution in Sphere Decoding (SD) for Multiple-Input Multiple-Output (MIMO) wireless communication systems. This paper also proposes a simpler initialization procedure for Newton's method. It is shown that as the size of the MIMO system increases, it becomes more tolerant to errors in the unconstrained solution for SD, and hence it requires a smaller number of Newton iterations. For a 16 × 16 MIMO system with QPSK or 16-QAM we show that 7 iterations are sufficient to ensure lossless SD performance. With only 4 iterations, a QPSK 32 × 32 MIMO system exhibits less than 0.1 dB performance loss relatively to SD employing the exact unconstrained solution.
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.001 |
| Open science | 0.001 | 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