Low Complexity ZF and MMSE Detectors for the Uplink MU-MIMO Systems With a Time-Varying Number of Active Users
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
The classical multiuser detection algorithms such as zero forcing (ZF) and minimum mean square error (MMSE) receivers are designed with the assumption that the number of active users is constant and known. When the number of the active users changes, the receiver may exhibit a serious performance loss if it does not react quickly to such variations. In this paper, we address the problem of reducing the complexity of the reevaluation of the popular ZF and MMSE detectors for multiuser multiple-input multiple-output (MU-MIMO) systems with a time-varying number of users in the channel. For each technique, we propose a detection approach with low complexity and without performance loss. The proposed algorithms avoid the direct computation of matrix inverses required by the ZF and MMSE detectors. Moreover, the performance losses, due to the use of the ZF and MMSE detectors intended for the scenario with a fixed number of active users, are evaluated with Monte Carlo simulation results.
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.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| 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