In this paper, we propose a new polar coding scheme for the unsourced, uncoordinated Gaussian random access channel. Our scheme is based on sparse spreading, treat interference as noise and successive interference cancellation (SIC). On the transmitters side, each user randomly picks a code-length and a transmit power from multiple choices according to some probability distribution to encode its message, and an interleaver to spread its encoded codeword bits across the entire transmission block. The encoding configuration of each user is transmitted by compressive sensing, similar to some previous works. On the receiver side, after recovering the encoding configurations of all users, it applies single-user polar decoding and SIC to recover the message list. Numerical results show that our scheme outperforms all previous schemes for active user number Ka ≥ 250, and provides competitive performance for Ka ≤ 225. Moreover, our scheme has much lower complexity compared to other schemes as we only use single-user polar coding.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Polar Coding and Sparse Spreading for Massive Unsourced Random Access


    Contributors:


    Publication date :

    2020-11-01


    Size :

    840241 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Slotted Polar Random Spreading Scheme for Massive MIMO Unsourced Random Access

    Liang, Zijie / Su, Yiwei / Song, Huiying et al. | IEEE | 2023


    A Polar Code Based Unsourced Random Access for the Gaussian MAC

    Marshakov, Evgeny / Balitskiy, Gleb / Andreev, Kirill et al. | IEEE | 2019


    Federated Learning with Unsourced Random Access

    Tian, Yuqing / Che, Jingze / Zhang, Zhaoyang et al. | IEEE | 2023


    Performance Evaluation of Unsourced Multiple Access with Polarization-Adjusted Convolutional Coding

    Sun, Zhuangzhuang / Xiao, Yue / Lin, Dengsheng et al. | IEEE | 2022