Interference Cancellation Aided Hybrid Beamforming for mmWave Multi-User Massive MIMO Systems
Bibliographic record
Abstract
In large scale multiple-input multiple-output (MIMO) systems (or massive MIMO systems), hybrid beamforming is a promising technique due to its versatile tradeoff between implementation cost (including hardware cost and power consumption) and system performance. In this paper, we investigate the downlink millimeter wave (mmWave) multi-user massive MIMO system and propose an interference cancellation (IC) framework on hybrid beamforming design. Based on the proposed framework, three successive interference cancellation (SIC) aided hybrid beamforming algorithms are proposed to deal with inter-user and intra-user interference. Specifically, for the first proposed algorithm, we use zero-forcing (ZF) to cancel inter-user interference and use SIC to cancel intra-user interference. For the second one, SIC is used to cancel inter-user interference and ZF is used to cancel intra-user interference. Both inter-user interference and intra-user interference are suppressed by SIC in the third algorithm. Furthermore, the optimal detection order of data streams is derived according to the post-detection signal-to-interference-plus-noise ratio (SINR). Numerical results show that the proposed SIC-aided hybrid beamforming algorithms outperforms the existing approaches in terms of spectral efficiency (SE) at the cost of computational complexity for the SIC procedure. Moreover, the results indicate that the proposed algorithms can achieve good SE performance with 2-bit finite resolution phase shifters and channel estimation error.
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.000 | 0.001 |
| 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.000 |
| 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".