Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 2020 | Submitted
Book Section - Chapter Open

Gaussian Multiple and Random Access in the Finite Blocklength Regime

Abstract

This paper presents finite-blocklength achievabil- ity 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 ½ log 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.

Additional Information

© 2020 IEEE. This work was supported in part by the National Science Foundation (NSF) under grant CCF-1817241.

Attached Files

Submitted - 2001.03867.pdf

Files

2001.03867.pdf
Files (1.1 MB)
Name Size Download all
md5:d8e71f8c0ad787045e0e9a764302ae73
1.1 MB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 19, 2023