2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | W.3.4 | ||
| Paper Title | Interleaved Block Coding for Achieving Gaussian Random Access Channel Capacity | ||
| Authors | Tugcan Aktas, Qualcomm Technologies, Inc., United States; Pinar Sen, University of California, San Diego, United States | ||
| Session | W.3: Random Access I | ||
| Presentation | Lecture | ||
| Track | Wireless Communications | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | This paper studies the detection problem for the Gaussian random access channels, in which only a randomly chosen $\a K$ out of $K$ senders wish to convey their messages to a receiver that has the side information of which sender is actively transmitting. A novel coding scheme, referred to as \emph{$L$-interleaved block coding}, based on interleaving $L$ single-user codes and successive cancellation decoding is proposed for the symmetric rate tuples in the capacity region of this channel. $L$-interleaved block coding with $L$ sufficiently large is shown to achieve arbitrarily close to the symmetric capacity. Therefore, it replaces the efforts of finding capacity achieving codes for the Gaussian random access channels with selecting $L$ off-the-shelf codes for Gaussian point-to-point channels for $L$ sufficiently large. An example illustrates that this scheme with a small number of blocks $(L=16)$ achieves more than $0.95$ of the symmetric capacity when two senders are active. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
