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 inte...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE Vehicular Technology Conference s. 1 - 5
Hlavní autoři: Ustinova, Daria, Glebov, Anton, Rybin, Pavel, Frolov, Alexey
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2019
Témata:
Binary codes
Encoding
Iterative algorithms
Iterative decoding
Maximum likelihood decoding
ISSN:2577-2465
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:2577-2465
DOI:10.1109/VTCFall.2019.8891568