Efficient Concatenated Same Codebook Construction for the Random Access Gaussian MAC

In this paper, a low complexity scheme for unsourced random multiple access over the Gaussian channel is proposed. Following the literature by the word "unsourced" we mean the fact that the users use the same codebook codes. The proposed scheme is based on T-fold ALOHA with successive interference cancellation (SIC) procedure. In each slot, the same codebook concatenated code construction with outer non-binary (NB) low- density parity-check (LDPC) code and inner linear binary code is decoded with iterative joint decoding algorithm. Outer NB-LDPC code is decoded with low-complexity iterative q-ary sum-product algorithm (QSPA) and short inner binary code is decoded with maximum likelihood. Finally, the numerical results and comparison with theoretical bounds are represented.

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

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

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

[4]  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).

[5]  Jun Cheng,et al.  A user-independent serial interference cancellation based coding scheme for the unsourced random access Gaussian channel , 2017, 2017 IEEE Information Theory Workshop (ITW).

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

[7]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[8]  Andrey Turlikov,et al.  Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC , 2018, 2019 IEEE Wireless Communications and Networking Conference (WCNC).

[9]  Gustavo Kasper Facenda,et al.  Efficient Scheduling for the Massive Random Access Gaussian Channel , 2019, IEEE Transactions on Wireless Communications.

[10]  P. Rybin,et al.  On iterative LDPC-based joint decoding scheme for binary input Gaussian multiple access channel , 2016, 2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY).

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

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