A User-Independent Successive Interference Cancellation Based Coding Scheme for the Unsourced Random Access Gaussian Channel

This work introduces a novel coding paradigm for the unsourced multiple access channel model. The envisioned framework builds on a select few key components. First, the transmission period is partitioned into a sequence of sub-blocks, thereby yielding a slotted structure. Second, messages are split...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications Jg. 67; H. 12; S. 8258 - 8272
Hauptverfasser: Vem, Avinash, Narayanan, Krishna R., Chamberland, Jean-Francois, Cheng, Jun
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.12.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">T -user adder channel
Algorithms
Channel coding
Codes
Coding
Compressed sensing
compressive sensing
Decoding
Density
forward error correction
Interference
Interference cancellation
Low density parity check codes
Message passing
Parity
Parity check codes
Random access
successive interference cancellation
Task analysis
Unsourced multiple access
ISSN:0090-6778, 1558-0857
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This work introduces a novel coding paradigm for the unsourced multiple access channel model. The envisioned framework builds on a select few key components. First, the transmission period is partitioned into a sequence of sub-blocks, thereby yielding a slotted structure. Second, messages are split into two parts. A portion of the data is encoded using spreading sequences or codewords that are designed to be recovered by a compressed sensing type decoder. In addition to being an integral part of the data, the information bits associated with this first part also determine the parameters of the low-density parity check code employed during the subsequent stages of the communication process. The other portion of the message is encoded using the aforementioned low-density parity check code. The data embedded in this latter stage is decoded using a joint message passing algorithm designed for the T-user binary input real adder channel. Finally, devices repeat their codeword in multiple sub-blocks, with the transmission pattern being a deterministic function of message content independent of the identity of the device. When combined with successive interference cancellation, the ensuing communication infrastructure offers significant performance improvement compared to coding schemes recently published in the literature for unsourced random access.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2019.2940216