Deep Learning-Based Activity Detection for Grant-Free Random Access

被引:6
作者
Inacio de Souza, Joao Henrique [1 ]
Abrao, Taufik [1 ]
机构
[1] Univ Estadual Londrina, Elect Engn Dept, BR-86057970 Londrina, Parana, Brazil
来源
IEEE SYSTEMS JOURNAL | 2023年 / 17卷 / 01期
关键词
Convolutional neural networks; Signal processing algorithms; Internet of Things; Interference; Symbols; Sparse matrices; Prediction algorithms; Convolutional neural network; grant-free access; Internet of Things (IoT); massive machine-type communications (mMTC); multilayer perceptron; random access protocols; SUPPORT RECOVERY; DEVICE ACTIVITY; USER DETECTION; DESIGN;
D O I
10.1109/JSYST.2022.3175658
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The cellular Internet of Things wireless network is a promising solution to provide massive connectivity for machine-type devices. However, designing grant-free random access (GF-RA) protocols to manage such connections is challenging, since they must operate in interference-aware scenarios with sporadic device activation patterns and a shortage of mutually orthogonal resources. Supervised machine learning models have provided efficient solutions for activity detection, noncoherent data detection, and nonorthogonal preamble design in scenarios with massive connectivity. In this article, we develop two deep learning (DL) sparse support recovery algorithms to detect active devices in massive machine-type communication random access. The DL algorithms, developed to deploy GF-RA protocols, are based on the deep multilayer perceptron and the convolutional neural network models. Unlike previous works, we investigate the impact of the type of sequences for preamble design on the activity detection accuracy. Our results reveal that preambles based on the Zadoff-Chu sequences, which present good correlation properties, achieve better activity detection accuracy with the proposed algorithms than random sequences. Besides, we demonstrate that our DL algorithms achieve activity detection accuracy comparable to state-of-the-art techniques with extremely low computational complexity.
引用
收藏
页码:940 / 951
页数:12
相关论文
共 33 条
[1]  
[Anonymous], 2012, COMPRESSED SENSING T
[2]  
[Anonymous], 2021, ARXIV210104726
[3]   AMP-Inspired Deep Networks for Sparse Linear Inverse Problems [J].
Borgerding, Mark ;
Schniter, Philip ;
Rangan, Sundeep .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2017, 65 (16) :4293-4308
[4]   Unsourced Random Massive Access With Beam-Space Tree Decoding [J].
Che, Jingze ;
Zhang, Zhaoyang ;
Yang, Zhaohui ;
Chen, Xiaoming ;
Zhong, Caijun ;
Ng, Derrick Wing Kwan .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2022, 40 (04) :1146-1161
[5]   Solving Sparse Linear Inverse Problems in Communication Systems: A Deep Learning Approach With Adaptive Depth [J].
Chen, Wei ;
Zhang, Bowen ;
Jin, Shi ;
Ai, Bo ;
Zhong, Zhangdui .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2021, 39 (01) :4-17
[6]  
Chen XM, 2021, IEEE J SEL AREA COMM, V39, P615, DOI 10.1109/JSAC.2020.3019724
[7]  
Chu D. C., 1972, IEEE Transactions on Information Theory, VIT-18, P531, DOI 10.1109/TIT.1972.1054840
[8]   Jointly Sparse Signal Recovery and Support Recovery via Deep Learning With Applications in MIMO-Based Grant-Free Random Access [J].
Cui, Ying ;
Li, Shuaichao ;
Zhang, Wanqing .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2021, 39 (03) :788-803
[9]   Analysis of Non-Orthogonal Sequences for Grant-Free RA With Massive MIMO [J].
Ding, Jie ;
Qu, Daiming ;
Choi, Jinho .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (01) :150-160
[10]   Message-passing algorithms for compressed sensing [J].
Donoho, David L. ;
Maleki, Arian ;
Montanari, Andrea .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2009, 106 (45) :18914-18919