Correlation-Aided Joint Activity Detection and Channel Estimation for Multidevice Collaborative Massive Access
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 investigates an uplink grant-free massive access (GF-MA) system, where a large number of IoT devices collaborate to achieve complex applications. For this scenario, device activity identification is a challenging problem due to the interference from massive devices and the limitation in the number of pilot sequences. By utilizing the inherent correlation features in multi-device collaborative scenarios, in this work, we present a detection approach that aims to enhance the accuracy of both activity detection and channel estimation. Specifically, we first propose a task-driven activity (TDA) model to capture the active probability in multi-device collaborative scenarios. Subsequently, considering the TDA model, we propose a message-passing-based algorithm named TDA-JDE for device activity detection and channel estimation. The proposed algorithm jointly processes messages containing channel impulse response (CIR), device activity, and task status information to leverage device activity correlation information. Finally, to obtain the parameters in the TDA model, we propose a parameter estimation algorithm based on the expectation-maximization framework with relaxation and reconstruction strategy (EM-RR). Extensive numerical results show that the proposed algorithm can achieve higher detection accuracy when compared with three benchmark schemes in multi-device collaborative massive access (MA) 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.
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.001 |
| 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