Efficient concatenated same codebook construction for the random access gaussian MAC

Daria Ustinova, Anton Glebov, Pavel Rybin, Alexey Frolov

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publication2019 IEEE 90th Vehicular Technology Conference, VTC 2019 Fall - Proceedings
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    ISBN (Electronic)9781728112206
    DOIs
    Publication statusPublished - Sep 2019
    Event90th IEEE Vehicular Technology Conference, VTC 2019 Fall - Honolulu, United States
    Duration: 22 Sep 201925 Sep 2019

    Publication series

    NameIEEE Vehicular Technology Conference
    Volume2019-September
    ISSN (Print)1550-2252

    Conference

    Conference90th IEEE Vehicular Technology Conference, VTC 2019 Fall
    Country/TerritoryUnited States
    CityHonolulu
    Period22/09/1925/09/19

    Fingerprint

    Dive into the research topics of 'Efficient concatenated same codebook construction for the random access gaussian MAC'. Together they form a unique fingerprint.

    Cite this