Gaussian Multiple and Random Access in the Finite Blocklength Regime

01/12/2020
by   Recep Can Yavas, et al.
0

This paper presents finite-blocklength achievability bounds for the Gaussian multiple access channel (MAC) and random access channel (RAC) under average-error and maximal-power constraints. Using random codewords uniformly distributed on a sphere and a maximum likelihood decoder, the derived MAC bound on each transmitter's rate matches the MolavianJazi-Laneman bound (2015) in its first- and second-order terms, improving the remaining terms to 1/2log n/n+O(1/n) bits per channel use. The result then extends to a RAC model in which neither the encoders nor the decoder knows which of K possible transmitters are active. In the proposed rateless coding strategy, decoding occurs at a time n_t that depends on the decoder's estimate t of the number of active transmitters k. Single-bit feedback from the decoder to all encoders at each potential decoding time n_i, i ≤ t, informs the encoders when to stop transmitting. For this RAC model, the proposed code achieves the same first-, second-, and third-order performance as the best known result for the Gaussian MAC in operation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/09/2019

Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios

This paper treats point-to-point, multiple access and random access loss...
research
02/02/2021

Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel

The work at hand presents a finite-blocklength analysis of the multiple ...
research
07/30/2020

A Second-Order Converse Bound for the Multiple-Access Channel via Wringing Dependence

A new converse bound is presented for the two-user multiple-access chann...
research
03/17/2021

Variable-length Feedback Codes with Several Decoding Times for the Gaussian Channel

We investigate variable-length feedback (VLF) codes for the Gaussian poi...
research
11/24/2019

Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases

In communication networks, cooperative strategies are coding schemes whe...
research
01/12/2020

Finite-Sample Analysis of Image Registration

We study the problem of image registration in the finite-resolution regi...
research
01/10/2018

Rate Selection and Power Adaptation using Maximal Ratio Combining for the Random Access Gaussian Channel

With the emergence of machine-driven communi- cation, there is a renewed...

Please sign up or login with your details

Forgot password? Click here to reset