User Selection for Multiple-Antenna Broadcast Channel with Zero-Forcing Beamforming
Bibliographic record
Abstract
This paper investigates the zero-forcing (ZF) beamforming transmit strategy in the multiple-antenna multiuser downlink systems. We consider the case of mobile users equipped with multiple antennas. Although the capacity of such systems can be achieved by dirty paper coding (DPC), DPC is extremely difficult and challenging to implement. Thus, simple but suboptimal linear beamforming techniques like ZF beamforming can be deployed. However, the number of users that can be served using this strategy is limited by the number of transmit antennas at the base station. The solution for this limitation is user selection (scheduling), which also exploits multiuser diversity. Therefore, user selection can be used to enhance the throughput of the system. Recently, it has been shown that ZF beamforming strategy with user selection is asymptotically optimal for a large number of users. In this paper, a semi-orthogonal user selection (SUS) algorithm is extended to the system with multiple-antenna mobile users. This algorithm aims to select users, which are semi-orthogonal. The optimal ZF beamforming matrices are obtained and it is shown that the optimal ZF beamforming throughput is related to the eigenvalues of the user channels. Therefore, SUS is aimed to select the proper group of users based on maximizing the channel eigenvalues and therefore improving the optimal ZF beamforming throughput of the system.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".