Pilot contamination mitigation strategies in massive MIMO systems
Bibliographic record
Abstract
Compared with the traditional multi‐user MIMO (multiple‐input and multiple‐output), massive MIMO aims to serve tens of users with hundreds of antennas on each base station. All users can use the same time–frequency resources through space division multiple access, leading to vast improvement on spectral efficiency. However, to achieve the benefits, channel state information is usually required, and the acquisition is difficult in massive MIMO systems. Theoretically, each user should be assigned with orthogonal pilot sequences to avoid interference; however, due to the huge number of users (much more than available orthogonal pilot sequences) in service, pilot reuse in adjacent cells is inevitable, causing inter‐cell interference. This phenomenon is often referred to as pilot contamination (PC) and is believed to be the fundamental limit on system capacity of massive MIMO systems. To solve this problem, many methods have been proposed since 2010, when the concept of massive MIMO was first proposed. In this study, the authors reviewed these methods, categorised them into four groups and compared their advantages and limitations. Although a survey on PC has been conducted by Elijah et al ., where they tried to cover various aspects of the PC issue, their work focuses on the analysis of rationale and limitations of different contamination mitigation methods. Besides, performance evaluations are conducted and presented.
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.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.001 | 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 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".