FASURA: A Scheme for Quasi-Static Fading Unsourced Random Access Channels

• Published in: IEEE transactions on communications Vol. 71; no. 11; p. 1
• Main Authors: Gkagkos, Michail, Narayanan, Krishna R., Chamberland, Jean-Francois, Georghiades, Costas N.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.11.2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Antennas; Channel estimation; Codes; Coding; Decoding; Error analysis; Estimation; Fading; Information retrieval; machine-type communication; massive multi-user MIMO; Messages; Polar codes; Random access; spread spectrum; Symbols; Unsourced random access
• ISSN: 0090-6778; 1558-0857
• DOI: 10.1109/TCOMM.2023.3296593

Unsourced random access emerged as a novel wireless paradigm enabling massive device connectivity on the uplink. We consider quasi-static Rayleigh fading wherein the access point has multiple receive antennas and every mobile device a single transmit antenna. The objective is to construct a coding scheme that minimizes the energy-per-bit subject to a maximum probability of error given a fixed message length and a prescribed number of channel uses. Every message is partitioned into two parts: the first determines pilot values and spreading sequences; the remaining bits are encoded using a polar code. The transmitted signal contains two distinct sections. The first features pilots and the second is composed of spread modulated symbols. The receiver has three modules: an energy detector, tasked with recovering the set of active pilot sequences; a bank of Minimum Mean Square Error (MMSE) estimators acting on measurements at the receiver; and a polar list-decoder, which seeks to retrieve the coded information bits. A successive cancellation step is applied to subtract recovered codewords, before the residual signal is fed back to the decoder. Empirical evidence suggests that an appropriate combination of these ideas can outperform state-of-the-art coding techniques when the number of active users exceeds one hundred.