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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Efficient Concatenated Same Codebook Construction for the Random Access Gaussian MAC


    Contributors:


    Publication date :

    2019-09-01


    Size :

    416222 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    An Improved Design of Concatenated Code Scheme for Massive Random Access

    Li, Yuanjie / Dong, Chao / Suo, Shiqiang et al. | IEEE | 2022



    Structured Random Codebook Design for GABP Iterative Detection in Massive SCMA

    Inagaki, Keisuke / Takahashi, Takumi / Ibi, Shinsuke et al. | IEEE | 2018


    Concatenated Approach to Trajectory Optimization

    Hans Seywald / Renjith R. Kumar | AIAA | 1997


    Efficient Gaussian process classification using random decision forests

    Fröhlich, B. / Rodner, E. / Kemmler, M. et al. | British Library Online Contents | 2011