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

被引:13
作者
Gkagkos, Michail [1 ]
Narayanan, Krishna R. [1 ]
Chamberland, Jean-Francois [1 ]
Georghiades, Costas N. [1 ]
机构
[1] Texas A&M Univ, Dept Elect & Comp Engn, College Stn, TX 77843 USA
基金
美国国家科学基金会;
关键词
Unsourced random access; massive multi-user MIMO; machine-type communication; polar codes; spread spectrum; MIMO;
D O I
10.1109/TCOMM.2023.3296593
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:6391 / 6401
页数:11
相关论文
共 38 条
[1]   Unsourced Random Access with a Massive MIMO Receiver Using Multiple Stages of Orthogonal Pilots [J].
Ahmadi, Mohammad Javad ;
Duman, Tolga M. .
2022 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, ISIT, 2022, :2880-2885
[2]  
Amalladinne VK, 2021, Arxiv, DOI arXiv:2105.02185
[3]   Unsourced Random Access With Coded Compressed Sensing: Integrating AMP and Belief Propagation [J].
Amalladinne, Vamsi K. ;
Pradhan, Asit Kumar ;
Rush, Cynthia ;
Chamberland, Jean-Francois ;
Narayanan, Krishna R. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (04) :2384-2409
[4]   An Enhanced Decoding Algorithm for Coded Compressed Sensing with Applications to Unsourced Random Access [J].
Amalladinne, Vamsi K. ;
Ebert, Jamison R. ;
Chamberland, Jean-Francois ;
Narayanan, Krishna R. .
SENSORS, 2022, 22 (02)
[5]   A Coded Compressed Sensing Scheme for Unsourced Multiple Access [J].
Amalladinne, Vamsi K. ;
Chamberland, Jean-Francois ;
Narayanan, Krishna R. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (10) :6509-6533
[6]  
Andreev Kirill, 2021, 2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY), P17, DOI 10.1109/REDUNDANCY52534.2021.9606444
[7]   Unsourced Random Access Based on List Recoverable Codes Correcting t Errors [J].
Andreev, Kirill ;
Rybin, Pavel ;
Frolov, Alexey .
2021 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
[8]  
Andreev K, 2020, IEEE INT SYMP INFO, P3019, DOI [10.1109/isit44484.2020.9174247, 10.1109/ISIT44484.2020.9174247]
[9]  
[Anonymous], 1998, Multiuser detection
[10]  
Bertsekas D., 2012, Dynamic programming and optimal control, VI