WLC38-6: Minimax Linear Precoding for MISO Broadcast Channels with Bounded Uncertainty
Bibliographic record
Abstract
We consider linear precoding for the downlink of a multiuser communication system in the presence of uncertain channel state information (CSI) at the base station. We consider systems in which the base station has multiple antennas and each user has a single antenna and the channel estimate at the receivers is quantized and fed back to the base station. For these systems we propose a deterministically bounded model for the channel uncertainty and a convex optimization formulation for the precoder that maximizes the worst-case performance under constraints on the power transmitted from each antenna. We also derive a closed-form expression for the precoder that maximizes the worst-case performance under a constraint on total transmitted power. The cost of computing this closed-form solution is the same as that of computing the solution to the corresponding method that assumes perfect channel knowledge. An interesting property of the proposed robust precoders is that they do not necessarily use all the allowable transmission power. Our simulations indicate that the proposed approach can significantly reduce the sensitivity of the linearly precoded downlink to uncertainty in the CSI.
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.004 |
| 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.001 |
| 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.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".