CaltechAUTHORS
  A Caltech Library Service

Random Access Channel Coding in the Finite Blocklength Regime

Effros, Michelle and Kostina, Victoria and Yavas, Recep Can (2018) Random Access Channel Coding in the Finite Blocklength Regime. In: 2018 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 1261-1265. ISBN 978-1-5386-4780-6. http://resolver.caltech.edu/CaltechAUTHORS:20181126-150049870

[img] PDF - Submitted Version
See Usage Policy.

253Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20181126-150049870

Abstract

Consider a random access communication scenario over a channel whose operation is defined for any number of possible transmitters. Inspired by the model recently introduced for the Multiple Access Channel (MAC) with a fixed, known number of transmitters by Polyanskiy, we assume that the channel is invariant to permutations on its inputs, and that all active transmitters employ identical encoders. Unlike Polyanskiy, we consider a scenario in which neither the transmitters nor the receiver know which or how many transmitters are active. We refer to this agnostic communication setup as the Random Access Channel, or RAC. Limited feedback is used to ensure that the collection of active transmitters remains fixed during each epoch. The decoder is tasked with determining from the channel output the number of active transmitters (k) and their messages but not which transmitter sent which message. The central result of this work demonstrates the achievability on a RAC of performance that is first-order optimal for the MAC in operation during each coding epoch. While prior multiple access schemes for a fixed number of transmitters require 2^k - 1 simultaneous threshold rules, the proposed scheme uses a single threshold rule and achieves the same dispersion.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/ISIT.2018.8437831DOIArticle
https://arxiv.org/abs/1801.09018arXivDiscussion Paper
ORCID:
AuthorORCID
Kostina, Victoria0000-0002-2406-7440
Additional Information:© 2018 IEEE. This material is based upon work supported by the National Science Foundation under Grant No. 1527524.
Funders:
Funding AgencyGrant Number
NSFCCF-1527524
Record Number:CaltechAUTHORS:20181126-150049870
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20181126-150049870
Official Citation:M. Effros, V. Kostina and R. C. Yavas, "Random Access Channel Coding in the Finite Blocklength Regime," 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, 2018, pp. 1261-1265. doi: 10.1109/ISIT.2018.8437831
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:91192
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:26 Nov 2018 23:07
Last Modified:02 Apr 2019 21:55

Repository Staff Only: item control page