Near-Optimal Coding for Massive Multiple Access

02/09/2021
by   Kuan Hsieh, et al.
0

We study the Gaussian multiple access channel (MAC) in the asymptotic regime where the number of users grows linearly with the codelength. We analyze coding schemes based on random linear models with approximate message passing (AMP) decoding. For fixed target error rate and number of bits per user, we obtain the exact tradeoff between energy-per-bit and the user density achievable in the large system limit. We show that a spatially coupled coding scheme with AMP decoding achieves near-optimal tradeoff for a large range of user densities. We also study the spectral efficiency versus energy-per-bit tradeoff in the regime where the number of bits per user is large.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/19/2023

CIAMA: A new multiple access scheme

This paper studies advanced multi-access techniques to support a high vo...
research
01/13/2018

LDPC Codes over Gaussian Multiple Access Wiretap Channel

We study the problem of two-user Gaussian multiple access channel (GMAC)...
research
01/17/2019

Spatially Coupled LDPC Codes and the Multiple Access Channel

We consider spatially coupled low-density parity-check (SC-LDPC) codes w...
research
04/26/2019

Capacity per Unit-Energy of Gaussian Many-Access Channels

We consider a Gaussian multiple-access channel where the number of trans...
research
01/03/2022

Improved bounds for the many-user MAC

Many-user MAC is an important model for understanding energy efficiency ...
research
05/07/2020

Soft Interference Cancellation for Random Coding in Massive Gaussian Multiple-Access

We utilize recent results on the exact block error probability of Gaussi...
research
05/11/2023

On the Advantages of Asynchrony in the Unsourced MAC

In this work we demonstrate how a lack of synchronization can in fact be...

Please sign up or login with your details

Forgot password? Click here to reset