Covariance Based Joint Activity and Data Detection for Massive Random Access with Massive MIMO
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper considers a grant-free random access scenario for massive machine-type communications (mMTC) in which the devices are sporadically active with small payloads. Each active device transmits the identification information as well as the data symbol by selecting a sequence from a pre-assigned sequence set, and the base-station (BS) detects both the device activity and the data by detecting which sequences are transmitted. This paper makes an observation that in the massive multiple-input multiple-output (MIMO) regime, where the BS is equipped with a large number of antennas, a covariance based detection scheme that solves a maximum likelihood estimation problem is more effective than the approximate message passing (AMP) based compressed sensing approach for sequence detection. A main contribution of this paper is an analytic framework capable of accurately predicting the performance of the proposed scheme in terms of the probabilities of false alarm and missed detection. The analysis is based on the asymptotic properties of the maximum likelihood estimator under a nonstandard condition. Simulation results validate the analysis, and demonstrate that as compared to the AMP based approach, the covariance based approach achieves lower error probabilities, especially when the sequence length is short, as is often the case for low-latency mMTC.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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 it