Polar Coding and Random Spreading for Unsourced Multiple Access

@article{Pradhan2019PolarCA,
  title={Polar Coding and Random Spreading for Unsourced Multiple Access},
  author={Asit Kumar Pradhan and Vamsi K. Amalladinne and Krishna R. Narayanan and Jean-François Chamberland},
  journal={ICC 2020 - 2020 IEEE International Conference on Communications (ICC)},
  year={2019},
  pages={1-6}
}
This article presents a novel transmission scheme for the unsourced, uncoordinated Gaussian multiple access problem. The proposed scheme leverages notions from single-user coding, random spreading, minimum-mean squared error (MMSE) estimation, and successive interference cancellation. Specifically, every message is split into two parts: the first fragment serves as the argument to an injective function that determines which spreading sequence should be employed, whereas the second component of… 

Figures and Tables from this paper

Polar Coding and Sparse Spreading for Massive Unsourced Random Access

Numerical results show that the proposed polar coding scheme for the unsourced, uncoordinated Gaussian random access channel outperforms all previous schemes for active user number Ka ≥ 250, and provides competitive performance for Ka ≤ 225.

LDPC Codes with Soft Interference Cancellation for Uncoordinated Unsourced Multiple Access

This article presents a novel enhancement to the random spreading based coding scheme developed by Pradhan et al. for the unsourced multiple access channel by replacing the SCLD based polar code with an LDPC code amenable to belief propagation decoding.

Pilot-Based Unsourced Random Access With a Massive MIMO Receiver, Interference Cancellation, and Power Control

This paper considers the unsourced random access problem on a Rayleigh block-fading AWGN channel with multiple receive antennas, and proposes an approach based on splitting the user messages into two parts which allows pathloss coefficients to be treated as deterministic unknowns by performing maximum likelihood estimation in each step of the MMV-AMP algorithm.

Massive Unsourced Random Access Over Rician Fading Channels: Design, Analysis, and Optimization

This article designs a novel codeword activity detection algorithm for the inner code of unsourced random access based on the distribution of received signals by exploiting the maximum-likelihood (ML) method and proposes an optimization algorithm to allocate the lengths of message bits and parity check bits so as to strike a balance between the error probability and the complexity required for outer decoding.

Unsourced Multiuser Sparse Regression Codes achieve the Symmetric MAC Capacity

This work shows that this concatenated coding construction for U-RA can achieve a vanishing per-user error probability in the limit of large blocklength and a large number of active users at sum-rates up to the symmetric Shannon capacity, and calculates the algorithmic threshold, that is a bound on the sum-rate up to which the inner decoding can be done reliably with the low-complexity AMP algorithm.

Pilot-Based Unsourced Random Access with a Massive MIMO Receiver, MRC and Polar Codes

This work treats the unsourced random access problem on a Rayleigh block-fading AWGN channel with multiple receive antennas and shows that a conventional approach based on the transmission of non-orthogonal pilot sequences with subsequent channel estimation and Maximum-Ratio-Combining provides a simple energy-efficient solution whose performance can be well approximated in closed form.

Sparse Kronecker-Product Coding for Unsourced Multiple Access

Numerical results show that the proposed scheme outperforms the state-of-the-art counterparts, and approaches the random coding bound within a gap of only 0.1 dB, and the error rate can be made very small even if the number of active users is relatively large.

Unsourced Random Access with a Massive MIMO Receiver Using Multiple Stages of Orthogonal Pilots

This work uses an iterative approach for decoding the transmitted messages along with a suitable successive interference cancellation scheme and significantly outperforms the existing approaches for URA over multiple-input multiple-output fading channels.

FASURA: A Scheme for Quasi-Static Massive MIMO Unsourced Random Access Channels

This article considers the massive MIMO unsourced random access problem on a quasi-static Rayleigh fading channel and shows that an appropriate combination of these ideas can substantially outperform state-of-the-art coding schemes when the number of active users is more than 100, making this the best performing scheme known for this regime.

Massive Random Access With Trellis-Based Codes and Random Signatures

We investigate unsourced and grant-free massive random access in which all the users employ the same codebook, and the basestation is only interested in decoding the distinct messages sent. To

References

SHOWING 1-10 OF 11 REFERENCES

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 that offers significant performance improvement compared to coding schemes recently published in the literature for unsourced random access.

A Coded Compressed Sensing Scheme for Uncoordinated Multiple Access

The proposed divide-and-conquer approach leverages recent advances in compressed sensing and forward error correction to produce a novel uncoordinated access paradigm, along with a computationally efficient decoding algorithm.

A Coupled Compressive Sensing Scheme for Uncoordinated Multiple Access

The proposed divide-and-conquer approach leverages recent advances in compressed sensing and forward error correction to produce a novel uncoordinated access paradigm, along with a computationally efficient decoding algorithm, for unsourced multiple-access communication.

A Joint Graph Based Coding Scheme for the Unsourced Random Access Gaussian Channel

This article introduces a novel communication paradigm for the unsourced, uncoordinated Gaussian multiple access problem that leverages the lessons learned from traditional IDMA into creating low- complexity schemes forThe unsourced setting and its inherent randomness.

A Polar Code Based Unsourced Random Access for the Gaussian MAC

This work proposes a polar code based scheme for the unsourced random access Gaussian channel based on T-fold irregular repetition slotted ALOHA (IRSA), which concludes that replacing of LDPC codes with polar codes in IRSA scheme leads to a significant performance gain.

CHIRRUP: a practical algorithm for unsourced multiple access

It is proved that the worst-case complexity of the basic chirp reconstruction algorithm is ${\mathscr{O}}[nK(\log _2^2 n + K)], which makes the reconstruction computationally feasible—a claim supported by reporting computing times for the algorithm.

SPARCs for Unsourced Random Access

Finite blocklength simulations show that the combination of AMP decoding, with suitable approximations, together with an outer code recently proposed by Amalladinne et.

Low complexity schemes for the random access Gaussian channel

We consider an uncoordinated Gaussian multiple access channel with a relatively large number of active users within each block. A low complexity coding scheme is proposed, which is based on a

Efficient Scheduling for the Massive Random Access Gaussian Channel

Simulation results show that, if a small feedback is allowed, the proposed scheme performs closely to the state-of-art while using simpler coding schemes, suggesting that novel grant-based schemes should not be dismissed as a potential solution to the massive random access problem.

An Enhanced Decoding Algorithm for Coded Compressed Sensing

This article introduces an enhanced decoding algorithm for coded compressed sensing where fragment recovery and the stitching process are executed in tandem, passing information between them, leading to gains in performance and a significant reduction in computational complexity.