Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.