Coordinated beamforming for the multicell multi-antenna wireless system
Bibliographic record
Abstract
In a conventional wireless cellular system, signal processing is performed on a per-cell basis; out-of-cell interference is treated as background noise. This paper considers the benefit of coordinating base-stations across multiple cells in a multi-antenna beamforming system, where multiple base-stations may jointly optimize their respective beamformers to improve the overall system performance. Consider a multicell downlink scenario where base-stations are equipped with multiple transmit antennas employing either linear beamforming or nonlinear dirty-paper coding, and where remote users are equipped with a single antenna each, but where multiple remote users may be active simultaneously in each cell. This paper focuses on the design criteria of minimizing either the total weighted transmitted power or the maximum per-antenna power across the base-stations subject to signal-to-interference-and-noise-ratio (SINR) constraints at the remote users. The main contribution of the paper is an efficient algorithm for finding the joint globally optimal beamformers across all base-stations. The proposed algorithm is based on a generalization of uplink-downlink duality to the multicell setting using the Lagrangian duality theory. An important feature is that it naturally leads to a distributed implementation in time-division duplex (TDD) systems. Simulation results suggest that coordinating the beamforming vectors alone already provide appreciable performance improvements as compared to the conventional per-cell optimized network.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".