DeepAI AI Chat
Log In Sign Up

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

by   Asit Pradhan, et al.

This article introduces a novel communication paradigm for the unsourced, uncoordinated Gaussian multiple access problem. The major components of the envisioned framework are as follows. The encoded bits of every message are partitioned into two groups. The first portion is transmitted using a compressive sensing scheme, whereas the second set of bits is conveyed using a multi-user coding scheme. The compressive sensing portion is key in sidestepping some of the challenges posed by the unsourced aspect of the problem. The information afforded by the compressive sensing is employed to create a sparse random multi-access graph conducive to joint decoding. This construction leverages the lessons learned from traditional IDMA into creating low-complexity schemes for the unsourced setting and its inherent randomness. Under joint message-passing decoding, the proposed scheme offers superior performance compared to existing low-complexity alternatives. Findings are supported by numerical simulations.


page 1

page 2

page 3

page 4


Polar Coding and Random Spreading for Unsourced Multiple Access

This article presents a novel transmission scheme for the unsourced, unc...

On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel

This paper deals with the problem of massive random access for Gaussian ...

A Coupled Compressive Sensing Scheme for Uncoordinated Multiple Access

This article introduces a novel communication scheme for the uncoordinat...

A Coupled Compressive Sensing Scheme for Unsourced Multiple Access

This article introduces a novel paradigm for the unsourced multiple-acce...

Multi-Class Unsourced Random Access via Coded Demixing

Unsourced random access (URA) is a recently proposed communication parad...

Efficient Massive Machine Type Communication (mMTC) via AMP

We propose efficient and low complexity multiuser detection (MUD) algori...

Asynchronous Neighbor Discovery Using Coupled Compressive Sensing

The neighbor discovery paradigm finds wide application in Internet of Th...