Compressive sensing based multi‐user detection for machine‐to‐machine communication

With the expected growth of machine-to-machine communication, new requirements for future communication systems have to be considered. More specifically, the sporadic nature of machine-to-machine communication, low data rates, small packets and a large number of nodes necessitate low overhead communication schemes that do not require extended control signaling for resource allocation and management. Assuming a star topology with a central aggregation node that processes all sensor information, one possibility to reduce control signaling is the estimation of sensor node activity. In this paper, we discuss the application of greedy algorithms from the field of compressive sensing in a channel coded code division multiple access context to facilitate a joint detection of sensor node activity and transmitted data. To this end, a short introduction to compressive sensing theory and algorithms will be given. The main focus, however, will be on implications of this new approach. Especially, we consider the activity detection, which strongly determines the performance of the overall system. We show that the performance on a system level is dominated by the missed detection rate in comparison with the false alarm rate. Furthermore, we will discuss the incorporation of activity-aware channel coding into this setup to extend the physical layer detection capabilities to code-aided joint detection of data and activity. Copyright © 2013 John Wiley & Sons, Ltd.

[1]  J. I. Mararm,et al.  Energy Detection of Unknown Deterministic Signals , 2022 .

[2]  Jiaru Lin,et al.  A joint recovery algorithm for distributed compressed sensing , 2012, Trans. Emerg. Telecommun. Technol..

[3]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[4]  E. Candès,et al.  Sparsity and incoherence in compressive sampling , 2006, math/0611957.

[5]  David L. Donoho,et al.  Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing , 2009, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[6]  Robert D. Nowak,et al.  Compressed Channel Sensing: A New Approach to Estimating Sparse Multipath Channels , 2010, Proceedings of the IEEE.

[7]  Rabab K. Ward,et al.  Fast group sparse classification , 2009 .

[8]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[9]  Kwang-Cheng Chen,et al.  Toward ubiquitous massive accesses in 3GPP machine-to-machine communications , 2011, IEEE Communications Magazine.

[10]  H. Zou,et al.  Regularization and variable selection via the elastic net , 2005 .

[11]  He Chen,et al.  Maximise lifetime of wireless sensor networks via a distributed cooperative routing algorithm , 2012, Trans. Emerg. Telecommun. Technol..

[12]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

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

[14]  Andreas Schenk,et al.  Compressed-sensing (decision-feedback) differential detection in impulse-radio ultra-wideband systems , 2011, 2011 IEEE International Conference on Ultra-Wideband (ICUWB).

[15]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[16]  Sundeep Rangan,et al.  Asymptotic Analysis of MAP Estimation via the Replica Method and Applications to Compressed Sensing , 2009, IEEE Transactions on Information Theory.

[17]  Yonina C. Eldar,et al.  Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques From Noisy Measurements , 2010, IEEE Journal of Selected Topics in Signal Processing.

[18]  Armin Dekorsy,et al.  Sparse Multi-User Detection for CDMA transmission using greedy algorithms , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[19]  Eric R. Ziegel,et al.  The Elements of Statistical Learning , 2003, Technometrics.

[20]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[21]  Georgios B. Giannakis,et al.  Sparsity-Aware Estimation of CDMA System Parameters , 2009, 2009 IEEE 10th Workshop on Signal Processing Advances in Wireless Communications.

[22]  Shengli Zhou,et al.  Application of compressive sensing to sparse channel estimation , 2010, IEEE Communications Magazine.

[23]  Joel A. Tropp Average-case analysis of greedy pursuit , 2005, SPIE Optics + Photonics.

[24]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[25]  Juan Hernández-Serrano,et al.  Low-Power Low-Rate Goes Long-Range: The Case for Secure and Cooperative Machine-to-Machine Communications , 2011, Networking Workshops.

[26]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

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

[28]  Justin K. Romberg,et al.  Channel protection: Random coding meets sparse channels , 2009, 2009 IEEE Information Theory Workshop.

[29]  Antonio Valdovinos,et al.  Efficient Feedforward Linearization Technique Using Genetic Algorithms for OFDM Systems , 2010, EURASIP J. Adv. Signal Process..

[30]  Sergio Verdu,et al.  Multiuser Detection , 1998 .

[31]  A. Robert Calderbank,et al.  Asynchronous code-division random access using convex optimization , 2011, Phys. Commun..

[32]  R. Baraniuk,et al.  Compressive Radar Imaging , 2007, 2007 IEEE Radar Conference.