Supporting More Active Users for Massive Access via Data-assisted Activity Detection

被引:6
作者
Bian, Xinyu [1 ]
Mao, Yuyi [1 ]
Zhang, Jun [1 ]
机构
[1] Hong Kong Polytech Univ, Dept Elect & Informat Engn, Hong Kong, Peoples R China
来源
IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2021) | 2021年
关键词
Internet-of-Things (IoT); massive connectivity; grant-free massive access; data-assisted user activity detection; approximate message passing (AMP); CHANNEL ESTIMATION; CONNECTIVITY;
D O I
10.1109/ICC42927.2021.9500797
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Massive machine-type communication (mMTC) has been regarded as one of the most important use scenarios in the fifth generation (5G) and beyond wireless networks, which demands scalable access for a large number of devices. While grant-free random access has emerged as a promising mechanism for massive access, its potential has not been fully unleashed. Particularly, the two key tasks in massive access systems, namely, user activity detection and data detection, were handled separately in most existing studies, which ignored the common sparsity pattern in the received pilot and data signal. Moreover, error detection and correction in the payload data provide additional mechanisms for performance improvement. In this paper, we propose a data-assisted activity detection framework, which aims at supporting more active users by reducing the activity detection error, consisting of false alarm and missed detection errors. Specifically, after an initial activity detection step based on the pilot symbols, the false alarm users are filtered by applying energy detection for the data symbols; once data symbols of some active users have been successfully decoded, their effect in activity detection will be resolved via successive pilot interference cancellation, which reduces the missed detection error. Simulation results show that the proposed algorithm effectively increases the activity detection accuracy, and it is able to support similar to 20% more active users compared to a conventional method in some sample scenarios.
引用
收藏
页数:6
相关论文
共 21 条
[1]   Massive Machine-Type Communications in 5G: Physical and MAC-Layer Solutions [J].
Bockelmann, Carsten ;
Pratas, Nuno ;
Nikopour, Hosein ;
Au, Kelvin ;
Svensson, Tommy ;
Stefanovic, Cedomir ;
Popovski, Petar ;
Dekorsy, Armin .
IEEE COMMUNICATIONS MAGAZINE, 2016, 54 (09) :59-+
[2]   On Overloaded Vector Precoding for Single-User MIMO Channels [J].
de Miguel, Rodrigo ;
Gardasevic, Vesna ;
Muller, Ralf R. ;
Knudsen, Finn F. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2010, 9 (02) :745-753
[3]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[4]   Joint Channel Estimation and Multiuser Detection for Uplink Grant-Free NOMA [J].
Du, Yang ;
Dong, Binhong ;
Zhu, Wuyong ;
Gao, Pengyu ;
Chen, Zhi ;
Wang, Xiaodong ;
Fang, Jun .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2018, 7 (04) :682-685
[5]  
Foucart S., 2013, APPL NUMERICAL HARMO
[6]   LOW-DENSITY PARITY-CHECK CODES [J].
GALLAGER, RG .
IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :21-&
[7]   A Survey of Access Management Techniques in Machine Type Communications [J].
Islam, Mohammad Tauhidul ;
Taha, Abd-Elhamid M. ;
Akl, Selim .
IEEE COMMUNICATIONS MAGAZINE, 2014, 52 (04) :74-81
[8]   Joint User Identification, Channel Estimation, and Signal Detection for Grant-Free NOMA [J].
Jiang, Shuchao ;
Yuan, Xiaojun ;
Wang, Xin ;
Xu, Chongbin ;
Yu, Wei .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2020, 19 (10) :6960-6976
[9]   Compressive Sensing-Based Adaptive Active User Detection and Channel Estimation: Massive Access Meets Massive MIMO [J].
Ke, Malong ;
Gao, Zhen ;
Wu, Yongpeng ;
Gao, Xiqi ;
Schober, Robert .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2020, 68 :764-779
[10]   Sparse Signal Processing for Grant-Free Massive Connectivity A future paradigm for random access protocols in the Internet of Things [J].
Liu, Liang ;
Larsson, Erik G. ;
Yu, Wei ;
Popovski, Petar ;
Stefanovic, Cedomir ;
de Carvalho, Elisabeth .
IEEE SIGNAL PROCESSING MAGAZINE, 2018, 35 (05) :88-99