Downlink MU-MIMO With QoS Aware Transmission: Precoder Design and Performance Analysis
Bibliographic record
Abstract
In this paper, a downlink wireless communication channel is considered. The base station (BS) has common data for all users, unicast data for a set of intended users, and transmits the superposition of these messages. This setting neither falls into the non-orthogonal multiple access (NOMA) nor into the multi-group multicasting literatures. In NOMA systems, the BS has unicast data for all users, and multiple users share the same resources. In multi-group multicasting, there are non-overlapping groups, each demanding a different multicast message. This paper studies precoder design to achieve maximum weighted sum rate (WSR). It is first shown that the precoders designed for WSR maximization and weighted minimum mean square error (WMMSE) minimization are equivalent. Second, an iterative low complexity algorithm (named WMMSE), based on WMMSE transmit precoders and receivers, is proposed. Another low-complexity precoder, the phase aligned zero forcing (PAZF) precoder, is also introduced. The results show that both algorithms converge fast. The WMMSE algorithm outperforms both PAZF and the zero-forcing (ZF) precoder for all signal-to-noise ratio ranges. It offers better interference management and high coherent combining gains for common data while PAZF finds the optimal phase rotation on the ZF precoder, and increases coherent combining gains.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 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".