Sparse Activity Detection for Massive Connectivity

DOI10.1109/TSP.2018.2795540MaRDI QIDQ4621705zbMATH OpenOpenAlexFDO

Authors Zhi Lin Chen, Foad Sohrabi, Wei Yu

Publication date 12 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.05873

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13)

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 paper proposes an AMP algorithm design that exploits the statistics of the wireless channel and provides an analytical characterization of the probabilities of false alarm and missed detection by using the state evolution. We consider two cases depending on whether the large-scale component of the channel fading is known at the BS and design the minimum mean squared error (MMSE) denoiser for AMP according to the channel statistics. Simulation results demonstrate the substantial advantage of exploiting the statistical channel information in AMP design; however, knowing the large-scale fading component does not offer tangible benefits. For the multiple-antenna case, we employ two different AMP algorithms, namely the AMP with vector denoiser and the parallel AMP-MMV, and quantify the benefit of deploying multiple antennas at the BS.

Recommendations

• Sparse Activity Detection in Multi-Cell Massive MIMO Exploiting Channel Large-Scale Fading
• Sparse Sensing for Distributed Detection
• scientific article; zbMATH DE number 6276262
• Cooperative Activity Detection: Sourced and Unsourced Massive Random Access Paradigms
• scientific article; zbMATH DE number 17137
• Massive Connectivity With Massive MIMO—Part I: Device Activity Detection and Channel Estimation
• A Dimension Reduction-Based Joint Activity Detection and Channel Estimation Algorithm for Massive Access
• Sparse multidimensional scaling for blind tracking in sensor networks
• Sparse network identifiability via compressed sensing

Cited in

(5)

• Binary sparse signal recovery with binary matching pursuit
• Binary component decomposition. I: The positive-semidefinite case
• Performance analysis for unconstrained analysis based approaches
• Binary generalized orthogonal matching pursuit
• Binary least squares: an algorithm for binary sparse signal recovery

This page was built for publication: Sparse Activity Detection for Massive Connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621705)