Sparse Activity Detection for Massive Connectivity

This paper considers the massive connectivity application in which a large number of devices communicate with a base-station (BS) in a sporadic fashion. Device activity detection and channel estimation are central problems in such a scenario. Due to the large number of potential devices, 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) or multiple measurement vector (MMV) problem depending on whether the BS has a single antenna or multiple antennas and 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 via state evolution. We consider two cases depending on whether or not the large-scale component of the channel fading is known at the BS and design the minimum mean squared error denoiser for AMP according to the channel statistics. Simulation results demonstrate the substantial advantage of exploiting the channel statistics in AMP design; however, knowing the large-scale fading component does not appear to 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.

[1]  A. Lozano,et al.  What Will 5 G Be ? , 2014 .

[2]  Alexander Jung,et al.  Joint channel estimation and activity detection for multiuser communication systems , 2015, 2015 IEEE International Conference on Communication Workshop (ICCW).

[3]  Richard G. Baraniuk,et al.  Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP) , 2011, IEEE Transactions on Information Theory.

[4]  Lei Zhang,et al.  Neighbor discovery for wireless networks via compressed sensing , 2010, Perform. Evaluation.

[5]  Andrea Montanari,et al.  Message-passing algorithms for compressed sensing , 2009, Proceedings of the National Academy of Sciences.

[6]  Jun Luo,et al.  Neighbor discovery in wireless ad hoc networks based on group testing , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[7]  HOMAS,et al.  Sparse Signal Processing Concepts for Efficient 5 G System Design , 2014 .

[8]  Philip Schniter,et al.  Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem , 2011, IEEE Transactions on Signal Processing.

[9]  Jong Chul Ye,et al.  Belief propagation for joint sparse recovery , 2011, ArXiv.

[10]  Gerhard Wunder,et al.  Compressive Random Access Using a Common Overloaded Control Channel , 2015, 2015 IEEE Globecom Workshops (GC Wkshps).

[11]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

[12]  Andrea Montanari,et al.  Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising , 2011, IEEE Transactions on Information Theory.

[13]  Philip Schniter,et al.  Turbo reconstruction of structured sparse signals , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[14]  Andrea Montanari,et al.  The dynamics of message passing on dense graphs, with applications to compressed sensing , 2010, 2010 IEEE International Symposium on Information Theory.

[15]  Xiao Xu,et al.  Active user detection and channel estimation in uplink CRAN systems , 2015, 2015 IEEE International Conference on Communications (ICC).

[16]  Carsten Bockelmann,et al.  Exploiting Sparsity in Channel and Data Estimation for Sporadic Multi-User Communication , 2013, ISWCS.

[17]  Andrea Montanari,et al.  Message passing algorithms for compressed sensing: I. motivation and construction , 2009, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[18]  Andrea Montanari,et al.  Graphical Models Concepts in Compressed Sensing , 2010, Compressed Sensing.

[19]  Sundeep Rangan,et al.  Generalized approximate message passing for estimation with random linear mixing , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

[20]  Holger Boche,et al.  Sparse Signal Processing Concepts for Efficient 5G System Design , 2014, IEEE Access.

[21]  Wei Yu,et al.  On the fundamental limits of massive connectivity , 2017, 2017 Information Theory and Applications Workshop (ITA).

[22]  Georgios B. Giannakis,et al.  Exploiting Sparse User Activity in Multiuser Detection , 2011 .

[23]  Andrea Montanari,et al.  The Noise-Sensitivity Phase Transition in Compressed Sensing , 2010, IEEE Transactions on Information Theory.

[24]  Jeffrey G. Andrews,et al.  What Will 5G Be? , 2014, IEEE Journal on Selected Areas in Communications.

[25]  Armin Dekorsy,et al.  Compressive Sensing Multi-User Detection with Block-Wise Orthogonal Least Squares , 2012, 2012 IEEE 75th Vehicular Technology Conference (VTC Spring).

[26]  Xu Chen,et al.  Capacity of Gaussian Many-Access Channels , 2016, IEEE Transactions on Information Theory.