Robust and Feasible QoS-Aware mmWave Massive MIMO Hybrid Beamforming
Bibliographic record
Abstract
Hybrid beamforming (HB) with quality-of-service (QoS) provisioning per stream in millimeter waves is indispensable in 5G/6G networks. HB includes baseband and radio frequency (RF) beamforming, and requires error-free channel state information (CSI), which is erroneous in practice. So there is a need for efficient, feasible, robust, and QoS-aware HB. To achieve this, we mitigate CSI uncertainty via baseband beamforming, and we steer the RF beamformer by using the estimates of the channel’s eigenvectors. In doing so, we consider the effective channel’s uncertainty region instead of the uncertainty region of the channel itself, as the former is smaller than the latter, requiring less transmit power to satisfy the QoS constraint. We also detect and eliminate the infeasible data streams. Our iterative scheme (which is based on the cutting-set method) for baseband beamforming satisfies the mean-squared error (MSE) constraint per stream, where a limited number of constraints are considered instead of infinitely many constraints. In our low-complexity scheme, we derive a simple sufficient condition to check the feasibility of each stream, we diagonalize the effective channel at the baseband precoder, and we use minimum MSE combining at the baseband combiner. Extensive simulations validate our formulations and theoretical derivations.
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.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 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".