Energy efficient random access for the quasi-static fading MAC
Author(s)
Kowshik, Suhas S.(Suhas Subramanya); Andreev, Kirill; Frolov, Alexey; Polyanskiy, Yury
DownloadAccepted version (252.6Kb)
Open Access Policy
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically, we extend the concept of random-access code introduced at ISIT'2017 by one of the authors to the practically more relevant case of the AWGN multiple-access channel (MAC) subject to Rayleigh fading, unknown to the decoder. We derive bounds on the fundamental limits of random-access coding and propose an alternating belief-propagation scheme as a candidate practical solution. The latter's performance was found to be surprisingly close to the information-theoretic bounds. It is curious, thus, that while fading significantly increases the minimal required energy-per-bit Eb/N0 (from about 0-2 dB to about 8-11 dB), it appears that it is much easier to attain the optimal performance over the fading channel with a practical scheme by leveraging the inherent randomization introduced by the channel. Finally, we mention that while a number of candidate solutions (MUSA, SCMA, RSMA, etc.) are being discussed for the 5G, the information-theoretic analysis and benchmarking has not been attempted before (in part due to lack of common random-access model). Our work may be seen as a step towards unifying performance comparisons of these methods.
Date issued
2019-09Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
2019 IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
2019. "Energy efficient random access for the quasi-static fading MAC." 2019 IEEE International Symposium on Information Theory (ISIT).
Version: Author's final manuscript
ISBN
978-1-5386-9291-2
ISSN
2157-8117