RSS Localization in Cell-Free Massive MIMO: Algorithms, Analysis, and Implementation
Bibliographic record
Abstract
Received signal strength (RSS) has been extensively studied for localization purposes, and the distributed nature of cell-free massive multiple-input multiple-output (CF-mMIMO) systems offers a new synergistic avenue for achieving high-precision localization. In this work, Open RAN and software-defined radio are used to realize the central and distributed units of a CF-mMIMO system to acquire the RSS measurements. By analyzing the experimental data, it is revealed that the RSS measured from the first-order reflection path can yield a sufficiently high signal-to-noise ratio for localization, enabling localization even without line-of-sight (LoS) paths. Inspired by this finding, a hybrid localization scheme, that can attain the best accuracy benchmarked by Cramér-Rao lower bound, is proposed to estimate the target position using both LoS and first-order non-line-of-sight RSS measurements. Furthermore, a theoretical framework is established to assess the fundamental limits of RSS-based localization in CF-mMIMO systems, offering a principled guideline for system designers to deploy and design localization systems in real-world scenarios.
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.001 | 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.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".