MétaCan
Menu
Back to cohort

Phase Transition Analysis for Covariance Based Massive Random Access with Massive MIMO

2019· preprint· en· W3013493556 on OpenAlexaff
Zhilin Chen, Wei Yu

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldEngineering
TopicSparse and Compressive Sensing Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsCovariance matrixCovarianceMIMORandom matrixComputer scienceRandom accessAlgorithmBase stationFisher informationMatrix (chemical analysis)Mathematical optimizationMathematicsStatisticsTelecommunicationsEigenvalues and eigenvectorsComputer network

Abstract

fetched live from OpenAlex

This paper studies the massive random access problem in which a large number of sporadically active devices wish to communicate to a base-station (BS) equipped with a large number of antennas. The devices are pre-assigned unique pilot sequences for random access. It has been shown previously that the device activity detection problem at the BS can be formulated as a maximum likelihood estimation (MLE) problem, whose solution depends on the sample covariance matrix of the received signal. This paper adopts the MLE formulation, and proposes an approach to analyze the covariance based detection by studying the asymptotic properties of the MLE via its associated Fisher information matrix. This paper proposes a necessary condition on the Fisher information matrix such that the estimation error tends to zero in the massive multiple-input multiple-output (MIMO) regime. A phase transition analysis is carried out based on the necessary condition. This paper also analyzes the distribution of the estimation error for the case with a large but finite number of antennas at the BS. Numerical experiments validate the 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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.009
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.009
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.030
GPT teacher head0.290
Teacher spread0.261 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations18
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicSparse and Compressive Sensing TechniquesFrench-language works237,207