DeepAI AI Chat
Log In Sign Up

Coded Compressed Sensing with List Recoverable Codes for the Unsourced Random Access

by   Kirill Andreev, et al.

We consider a coded compressed sensing approach for the unsourced random access and replace the outer tree code proposed by Amalladinne et al. with the list recoverable code capable of correcting t errors. A finite-length random coding bound for such codes is derived. The numerical experiments in the single antenna quasi-static Rayleigh fading MAC show that transition to list recoverable codes correcting t errors improves the performance of coded compressed sensing scheme by 7-10 dB compared to the tree code-based scheme. We propose two practical constructions of outer codes. The first is a modification of the tree code. It utilizes the same code structure, and a key difference is a decoder capable of correcting up to t errors. The second is based on the Reed-Solomon codes and Guruswami-Sudan list decoding algorithm. The first scheme provides an energy efficiency very close to the random coding bound when the decoding complexity is unbounded. But for the practical parameters, the second scheme is better and improves the performance of a tree code-based scheme when the number of active users is less than 200.


page 1

page 2

page 3

page 4


Unsourced Random Access with Coded Compressed Sensing: Integrating AMP and Belief Propagation

Sparse regression codes with approximate message passing (AMP) decoding ...

On Approximate Message Passing for Unsourced Access with Coded Compressed Sensing

Sparse regression codes with approximate message passing (AMP) decoding ...

An Enhanced Decoding Algorithm for Coded Compressed Sensing with Applications to Unsourced Random Access

Unsourced random access (URA) has emerged as a pragmatic framework for n...

Optimizing Codes for Source Separation in Color Image Demosaicing and Compressive Video Recovery

There exist several applications in image processing (eg: video compress...

On Decoding Cohen-Haeupler-Schulman Tree Codes

Tree codes, introduced by Schulman, are combinatorial structures essenti...

SPARCs for Unsourced Random Access

This paper studies the optimal achievable performance of compressed sens...