Multi-User Downlink Beamforming Using Uplink Downlink Duality With 1-Bit Converters for Flat Fading Channels
Bibliographic record
Abstract
The increased power consumption of high-resolution data converters at higher carrier frequencies and larger bandwidths is becoming a bottleneck for communication systems. In this paper, we consider a fully digital base station equipped with 1-bit analog-to-digital (in uplink) and digital-to-analog (in downlink) converters on each radio frequency chain. The base station communicates with multiple single antenna users with individual SINR constraints. We first establish the uplink downlink duality principle under 1-bit hardware constraints under an uncorrelated quantization noise assumption. We then present a linear solution to the multi-user downlink beamforming problem based on the uplink downlink duality principle. The proposed solution takes into account the hardware constraints and jointly optimizes the downlink beamformers and the power allocated to each user. Optimized dithering obtained by adding dummy users to the true system users ensures that the uncorrelated quantization noise assumption is true under realistic settings. Detailed simulations carried out using 3GPP channel models generated fromQuadrigashow that our proposed solution outperforms state of the art solutions in terms of the ergodic sum and minimum rate especially when the number of users is large. We also demonstrate that the proposed solution significantly reduces the performance gap from non-linear solutions in terms of the uncoded bit error rate at a fraction of the computational complexity.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| 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.003 | 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".