A user-independent serial interference cancellation based coding scheme for the unsourced random access Gaussian channel

We propose a novel coding scheme for the unsourced multiple access channel model introduced by Polyanskiy [1]. This new paradigm is composed of four main ingredients: (i) the transmission period is partitioned into sub-blocks, thereby instituting a slotted framework; (ii) The message (data) is split...

Full description

Saved in:
Bibliographic Details
Published in2017 IEEE Information Theory Workshop (ITW) pp. 121 - 125
Main Authors Vem, Avinash, Narayanan, Krishna R., Jun Cheng, Chamberland, Jean-Francois
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2017
Subjects
Adders
Compressed sensing
Decoding
Encoding
Indexes
Interference cancellation
Parity check codes
Slotted ALOHA
T-user adder channel
Online AccessGet full text

Cover

More Information
Summary:We propose a novel coding scheme for the unsourced multiple access channel model introduced by Polyanskiy [1]. This new paradigm is composed of four main ingredients: (i) the transmission period is partitioned into sub-blocks, thereby instituting a slotted framework; (ii) The message (data) is split into two parts and one part chooses an interleaver for a low density parity check (LDPC) type code. This part of the message is encoded using spreading sequences or codewords that are designed to be decoded by a compressed sensing type decoder; (iii) The other part of the message is encoded using a low density parity check (LDPC) type code and decoded using a joint message passing decoding algorithm designed for the T-user binary input real adder channel; (iv) users repeat their codeword in multiple sub-blocks, with the transmission pattern being a deterministic function of message content and independent of the identity of the user. When this coding scheme is combined with serial interference cancellation, the ensuing communication infrastructure can offer significant performance improvements compared to the recently proposed coding scheme in [2] and results in the best performing coding scheme to date.
DOI:10.1109/ITW.2017.8278023