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.
Efficient Concatenated Same Codebook Construction for the Random Access Gaussian MAC
01.09.2019
416222 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Concatenated algebraic decoder
NTRS | 1977
Concatenated Approach to Trajectory Optimization
AIAA | 1997
|Efficient Gaussian process classification using random decision forests
British Library Online Contents | 2011
|