Operating Multi-User Massive MIMO Networks: Trade-Off Between Performance and Runtime
Bibliographic record
Abstract
While multi-user (MU) massive MIMO is a critical technology for next generation wireless systems, its complexity poses significant operational challenges as it entails several processes. These include user selection, precoding, power distribution among the users, and Modulation and Coding Scheme (MCS) selection. While many studies have been conducted on MU-MIMO, most have made invalid assumptions (e.g., every non-zero signal received at a user yields a non-zero rate) or excluded some essential steps (e.g., MCS selection). We revisit the problem of operating a single-cell massive MIMO network with zero-forcing precoding, and develop real-time network operation algorithms. First, we relax the real-time constraint and perform an offline study to obtain a target performance for online algorithms. The joint problem can be solved exactly offline for small to medium sized settings using branch-reduce-and-bound. For larger settings, we note that, given a choice of user selection, the problem reduces to a power distribution problem that can be solved exactly. Thus, the joint problem reduces to a search over user-sets where for each considered user-set, a power distribution problem is solved. We propose various search methods and evaluate their performance. For online operation, we leverage the problem structure to propose an algorithm based on three ideas: i) grouping, 2) MCS-aware power distribution, and 3) an iterative process to remove users that see a zero rate. The algorithm achieves 94% of the performance target set by the offline study 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.
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".