Pilot Decontamination in Noncooperative Massive MIMO Cellular Networks Based on Spatial Filtering
Bibliographic record
Abstract
Pilot contamination has been known as one of the most challenging issues in massive multiple-input multiple-output (MIMO) systems. Every user will experience interferences from users in adjacent cells who employ the same pilot sequence. For cell-edge users, pilot contamination is particularly detrimental, because their signals might be overwhelmed by the interference. In this paper, we propose a pilot decontamination method based on a spatial filter, which exploits the spatial sparsity of massive MIMO channels. In massive MIMO systems, the communication protocols are generally divided into four phases: pilot transmission, processing, uplink data transmission, and downlink data transmission. In the first phase, the base station (BS) receives both the desired signal and the pilot contaminated signal. In the second phase, all users in the target cell stay silent for one symbol period, and the BS only receives interference from adjacent cells. The fast Fourier transform can then be employed to analyze the spatial spectrums of the received signals. The spatial sparsity of the massive MIMO channels makes it possible to identify the pilot contamination components by comparing the two spectrums on different spatial signatures (or angles of arrival). A spatial filter can then be constructed to eliminate pilot contamination. Both the theoretical analysis and simulation results demonstrate the effectiveness of the proposed method, whose complexity is comparable to that of the traditional matched filter-based channel estimator.
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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 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".