Dynamic cooperation link selection for network MIMO systems with limited backhaul capacity
Bibliographic record
Abstract
Base-station (BS) cooperation in wireless cellular networks offers a promising approach for interference mitigation. However, the implementation of practical network multi-input multi-output (MIMO) system also faces the challenge of high capacity cost for sharing the user data over the backhaul connections. This paper considers a downlink multi-cell orthogonal frequency-division multiple-access (OFDMA) network where the capacities of the backhaul links between the BSs are limited, and extends the single-antenna BS multi-cell system model considered in our previous work to the multiple-antenna BS case. The BSs use zero-forcing precoding to spatially multiplex multiple users within each cell and to pre-subtract the interference from cooperating BSs that share user data with them. An iterative algorithm that maximizes the downlink network utility is proposed. The algorithm iteratively selects the cooperation links, schedules the users, and optimizes the precoding coefficients and the power spectra for each frequency tone. Numerical results suggest that the use of dynamic cooperation link selection can provide a better trade-off between the downlink sum-rate gain and the backhaul capacity than the earlier fixed link-selection algorithm.
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.001 | 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.001 | 0.000 |
| 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".