Low-Complexity Detectors for Uplink Massive MIMO Systems Leveraging Truncated Polynomial Expansion
Bibliographic record
Abstract
In this work, we propose low-complexity detectors for massive multiple-input multiple-output (MIMO) systems. Particularly, we leverage variants of truncated polynomial expansion (TPE) in order to reduce the computational complexity of the signal detection in the uplink direction. Linear detectors such as zero-forcing (ZF) and minimum mean square error (MMSE) involve expensive matrix-matrix multiplication and matrix inversion operations. TPE-based detectors are appropriate candidates for approximating these linear detectors. However, tuning the normalization factor of TPE-based detectors may require calculating the minimum and the maximum eigenvalues of the channel Gram matrix. These calculations become computationally expensive for some massive MIMO systems, especially for systems with a large ratio of single-antenna user terminals to the number of antennas at the base station, i.e., loading factor. We propose to tune the normalization factor using appropriate approximations for the extreme eigenvalues. The proposed TPE-based detectors exhibit a bit error performance similar to that of the TPE-based detector with the optimal normalization factor. Moreover, our proposed detectors achieve the error performance of ZF and MMSE for different loading factors of spatially correlated and uncorrelated massive MIMO channels. The computational complexity of the proposed detector is proportional to the number of base station antennas and the number of users.
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.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 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".