On Approximate Message Passing for Unsourced Access with Coded Compressed Sensing

Sparse regression codes with approximate message passing (AMP) decoding have gained much attention in recent times. The concepts underlying this coding scheme extend to unsourced access with coded compressed sensing (CCS), as first pointed out by Fengler, Jung, and Caire. More specifically, their approach uses a concatenated coding framework with an inner AMP decoder followed by an outer tree decoder. In the original implementation, these two components work independently of each other, with the tree decoder acting on the static output of the AMP decoder. This article introduces a novel framework where the inner AMP decoder and the outer tree decoder operate in tandem, dynamically passing information back and forth to take full advantage of the underlying CCS structure. The enhanced architecture exhibits significant performance benefit over a range of system parameters.

[1]  Ramji Venkataramanan,et al.  Techniques for Improving the Finite Length Performance of Sparse Superposition Codes , 2017, IEEE Transactions on Communications.

[2]  Sekhar Tatikonda,et al.  Sparse Regression Codes , 2019, Found. Trends Commun. Inf. Theory.

[3]  Vamsi K. Amalladinne,et al.  A Coded Compressed Sensing Scheme for Uncoordinated Multiple Access , 2018 .

[4]  Yury Polyanskiy,et al.  Low complexity schemes for the random access Gaussian channel , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[5]  Jean-Francois Chamberland,et al.  A Joint Graph Based Coding Scheme for the Unsourced Random Access Gaussian Channel , 2019, 2019 IEEE Global Communications Conference (GLOBECOM).

[6]  RushCynthia,et al.  Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding , 2017 .

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

[8]  Krishna R. Narayanan,et al.  A Coupled Compressive Sensing Scheme for Unsourced Multiple Access , 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[9]  Jun Cheng,et al.  A User-Independent Successive Interference Cancellation Based Coding Scheme for the Unsourced Random Access Gaussian Channel , 2019, IEEE Transactions on Communications.

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

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

[12]  Jean-Francois Chamberland,et al.  Polar Coding and Random Spreading for Unsourced Multiple Access , 2019, ICC 2020 - 2020 IEEE International Conference on Communications (ICC).

[13]  Jean-Francois Chamberland,et al.  An Enhanced Decoding Algorithm for Coded Compressed Sensing , 2020, ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[14]  Alexey Frolov,et al.  A Polar Code Based Unsourced Random Access for the Gaussian MAC , 2019, 2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall).

[15]  Robert Calderbank,et al.  CHIRRUP: a practical algorithm for unsourced multiple access , 2018, Information and Inference: A Journal of the IMA.

[16]  Andrew R. Barron,et al.  Fast Sparse Superposition Codes Have Near Exponential Error Probability for $R<{\cal C}$ , 2014, IEEE Transactions on Information Theory.