Generalized Channel Estimation and User Detection for Massive Connectivity With Mixed-ADC Massive MIMO
Bibliographic record
Abstract
This paper aims to provide a partial discrete Fourier transform (DFT) pilot sequence assisted joint channel estimation and user activity detection scheme for massive connectivity, in which a large number of devices with sporadic transmission communicate with a base station (BS) in the uplink. The joint channel estimation and device detection problem can be formulated as a compressed sensing single measurement vector or multiple measurement vector (MMV) problem depending on whether the BS is equipped with single or large number of antennas. Due to high hardware cost and power consumption in massive multiple-input multiple-output (MIMO) systems, a mixed analog-to-digital converter (ADC) architecture is considered. In order to accommodate a large number of simultaneously transmitting devices, the joint channel estimation and active user detection are formulated as an MMV problem for the massive connectivity scenario; and the proposed GTurbo-MMV algorithm can precisely estimate the channel state information and detect active devices with relatively low overhead. Furthermore, we study the state evolution (SE) for the MMV problem to obtain achievable bounds on channel estimation and device detection performance, in which both the missing and false detection probabilities can be made tend to zero in the massive MIMO regime. The simulation results confirm the theoretical accuracy of our analysis.
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.000 |
| 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".