Improved bounds for the many-user MAC

01/03/2022
by   Suhas S Kowshik, et al.
0

Many-user MAC is an important model for understanding energy efficiency of massive random access in 5G and beyond. Introduced in Polyanskiy'2017 for the AWGN channel, subsequent works have provided improved bounds on the asymptotic minimum energy-per-bit required to achieve a target per-user error at a given user density and payload, going beyond the AWGN setting. The best known rigorous bounds use spatially coupled codes along with the optimal AMP algorithm. But these bounds are infeasible to compute beyond a few (around 10) bits of payload. In this paper, we provide new achievability bounds for the many-user AWGN and quasi-static Rayleigh fading MACs using the spatially coupled codebook design along with a scalar AMP algorithm. The obtained bounds are computable even up to 100 bits and outperform the previous ones at this payload.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/20/2020

Energy-efficiency of Massive Random Access with Individual Codebook

The massive machine-type communication has been one of the most represen...
research
02/04/2023

Energy Efficiency of MIMO Massive Unsourced Random Access with Finite Blocklength

This paper investigates the energy efficiency of massive unsourced rando...
research
10/21/2022

Energy Efficiency of Massive Random Access in MIMO Quasi-Static Rayleigh Fading Channels with Finite Blocklength

This paper considers the massive random access problem in MIMO quasi-sta...
research
02/09/2021

Near-Optimal Coding for Massive Multiple Access

We study the Gaussian multiple access channel (MAC) in the asymptotic re...
research
01/20/2019

Fundamental limits of many-user MAC with finite payloads and fading

Consider a (multiple-access) wireless communication system where users a...
research
10/04/2022

Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing

We present finite-blocklength achievability bounds for the unsourced A-c...
research
04/05/2023

Energy Efficiency of Unsourced Random Access over the Binary-Input Gaussian Channel

We investigate the fundamental limits of the unsourced random access ove...

Please sign up or login with your details

Forgot password? Click here to reset