Multi-Point Coordination in Massive MIMO Systems With Sectorized Antennas
Bibliographic record
Abstract
Non-cooperative cellular massive MIMO, combined with power control, is known to lead to significant improvements in per-user throughput compared with conventional LTE technology. In this paper, we investigate further refinements to massive MIMO, first, in the form of three-fold sectorization, and second, coordinated multi-point operation (with and without sectorization), in which the three base stations cooperate in the joint service of their users. For these scenarios, we analyze the downlink performance for both maximum-ratio and zero-forcing precoding and derive closed-form lower-bound expressions on the achievable rate of the users. These expressions are then used to formulate power optimization problems with two throughput fairness criteria:${i}$) network-wide max-min fairness, andii) per-cell max-min fairness. Furthermore, we provide centralized and decentralized power control strategies to optimize the transmit powers in the network. We demonstrate that employing sectorized antenna elements mitigates the detrimental effects of pilot contamination by rejecting a portion of interfering pilots in the spatial domain during channel estimation phase. Simulation results with practical sectorized antennas reveal that sectorization and multi-point coordination combined with sectorization lead to more than$1.7\times $and$2.6\times $improvements in the 95%-likely per-user throughput, respectively.
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.002 |
| 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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".