Uplink Performance Analysis for Massive MIMO Linear Processing
Bibliographic record
Abstract
This paper considers an uplink massive MIMO system, in which the base station (BS) is equipped with a very large antenna array to serve multiple users simultaneously in the presence of out-of-cell interferers. Multi-cell minimum mean-square-error (M-MMSE) detection is used to mitigate co-channel interference (CCI) and multipath fading effects. However, this receiver processing brings high computational complexity to bear in a real-time massive MIMO scenario. To overcome this higher complexity, novel two-layer linear receiver processing schemes are proposed in this work, which can achieve a good trade-off between performance and complexity. The proposed architecture consists of two layers: 1) splitting the antenna array into a number of subsets, and performing M-MMSE processing at the subset level; 2) combining the resulting subset outputs using either MRC or M-MMSE detectors. Taking into account both small- and large-scale fading, we investigate the system performance and the computational complexity of the proposed receivers. To further characterize the advantages of the proposed schemes, they are compared with conventional detectors. Numerical simulations show that the proposed schemes approach the performance of conventional M-MMSE processing, albeit with significantly reduced complexity. We also derived tight expressions for intra-cell and inter-cell residual interference powers at the output of the first processing layer. An important observation is that the inter-cell interference dominates the total interference, especially when shadowing is strong or the subset size is comparable to the total number of users. However, performing M-MMSE at the second processing layer provides significant gains in this context.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 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.004 | 0.001 |
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".