Sparse Activity Detection for Massive Connectivity
Zhilin Chen, Foad Sohrabi, Wei Yu

TL;DR
This paper develops an efficient compressed sensing-based approach using AMP algorithms for joint device activity detection and channel estimation in massive connectivity scenarios, leveraging sparsity and statistical channel information.
Contribution
It introduces AMP algorithms tailored for massive connectivity, exploiting channel statistics and antenna configurations, with analytical performance characterization.
Findings
Exploiting channel statistics improves detection performance.
Multiple antennas enhance detection accuracy.
Knowing large-scale fading offers limited benefits.
Abstract
This paper considers the massive connectivity application in which a large number of potential devices communicate with a base-station (BS) in a sporadic fashion. The detection of device activity pattern together with the estimation of the channel are central problems in such a scenario. Due to the large number of potential devices in the network, the devices need to be assigned non-orthogonal signature sequences. The main objective of this paper is to show that by using random signature sequences and by exploiting sparsity in the user activity pattern, the joint user detection and channel estimation problem can be formulated as a compressed sensing single measurement vector (SMV) problem or multiple measurement vector (MMV) problem, depending on whether the BS has a single antenna or multiple antennas, and be efficiently solved using an approximate message passing (AMP) algorithm. This…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
