SPARCs and AMP for Unsourced Random Access

This paper studies the optimal achievable performance of compressed sensing based unsourced random-access communication over the real AWGN channel. "Unsourced" means that every user employs the same codebook. This paradigm, recently introduced by Polyanskiy, is a natural consequence of a very large number of potential users of which only a finite number is active in each time slot. The resemblance of compressed sensing based communication and sparse regression codes (SPARCs), a novel type of point-to-point channel codes, allows us to design and analyse an efficient unsourced random-access code. Finite blocklength simulations show that the combination of AMP decoding, with suitable approximations, together with an outer code recently proposed by Amalladinne et. al. outperforms state of the art methods in terms of required energyper-bit at lower decoding complexity.

[1]  Ramji Venkataramanan,et al.  Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding , 2015, IEEE Transactions on Information Theory.

[2]  Nicolas Macris,et al.  Mutual Information and Optimality of Approximate Message-Passing in Random Linear Estimation , 2017, IEEE Transactions on Information Theory.

[3]  Andrea Montanari,et al.  Universality in Polytope Phase Transitions and Message Passing Algorithms , 2012, ArXiv.

[4]  Florent Krzakala,et al.  Approximate Message-Passing Decoder and Capacity Achieving Sparse Superposition Codes , 2015, IEEE Transactions on Information Theory.

[5]  Andrea Zanella,et al.  Long-range communications in unlicensed bands: the rising stars in the IoT and smart city scenarios , 2015, IEEE Wireless Communications.

[6]  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.

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

[8]  Sergio Verdú,et al.  Randomly spread CDMA: asymptotics via statistical physics , 2005, IEEE Transactions on Information Theory.

[9]  Yury Polyanskiy,et al.  A perspective on massive random-access , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[10]  Giuseppe Caire,et al.  SPARCs for Unsourced Random Access , 2019, ArXiv.

[11]  Krishna R. Narayanan,et al.  A Coupled Compressive Sensing Scheme for Uncoordinated Multiple Access , 2018, ArXiv.

[12]  A. Barron,et al.  Sparse Superposition Codes: Fast and Reliable at Rates Approaching Capacity with Gaussian Noise , 2010 .

[13]  Andrea Montanari,et al.  State Evolution for Approximate Message Passing with Non-Separable Functions , 2017, Information and Inference: A Journal of the IMA.

[14]  Matthias Hein,et al.  Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization , 2012, 1205.0953.

[15]  A. El Gamal,et al.  Multiple user information theory , 1980, Proceedings of the IEEE.