Joint Sparse Channel Estimation and Multiuser Detection Using Spike and Slab Prior-Based Gibbs Sampling for Uplink Grant-Free NOMA

被引:0
作者
Zhang, Xiaoxu [1 ]
Zhou, Ziyang [1 ]
Ding, Zhiguo [2 ]
Ma, Zheng [1 ]
Hao, Li [1 ]
机构
[1] Southwest Jiaotong Univ, Prov Key Lab Informat Coding & Transmiss, Chengdu 611756, Peoples R China
[2] Khalifa Univ, Dept Elect Engn & Comp Sci, Abu Dhabi 127788, U Arab Emirates
基金
美国国家科学基金会;
关键词
Multiuser detection; Data models; Channel estimation; Vectors; Slabs; Matching pursuit algorithms; Approximation algorithms; grant-free non-orthogonal multiple access; massive machine-type communications; multiuser detection; spike-and-slab prior; ACCESS;
D O I
10.1109/TVT.2024.3451450
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Large-scale multiuser detection (MUD) is a critical aspect for the emerging sixth generation (6G) networks. Accurate and efficient recovery of users from vast amounts of data is the key aspect for massive machine-type communications (mMTC). Grant-free non-orthogonal multiple access (GF-NOMA) has been recognized as a suitable multiple access technique for mMTC scenarios. Leveraging the inherent sparsity poverty of mMTC combining with GF-NOMA, MUD can be recast as a compressive sensing (CS) problem. However, the existing schemes are facing the challenge of limited accuracy and high computational complexity. In this paper, we first focus on the study of joint channel estimation (CE) and MUD under the single measurement vectors (SMV) model, where a novel approach using spike-and-slab priors with Gibbs sampling (SS-GS) is proposed to solve the MUD problem. To exploit the structural sparsity and improve the recovery performance, we also devise a truncated spike-and-slab priors with Gibbs sampling approach (TSS-GS) under the multiple measurement vectors (MMV) model to retrieving transmitted signals through the channel. The MMV model is transformed into a new model to better exploit signal sparsity. We compare the performance of the proposed methods with traditional detectors. Extensive simulation experiments and analysis are presented to demonstrate the advantages of the proposed algorithm in terms of performance and efficiency.
引用
收藏
页码:19338 / 19349
页数:12
相关论文
共 36 条
[1]   Iterative Order Recursive Least Square Estimation for Exploiting Frame-Wise Sparsity in Compressive Sensing-Based MTC [J].
Abebe, Ameha T. ;
Kang, Chung G. .
IEEE COMMUNICATIONS LETTERS, 2016, 20 (05) :1018-1021
[2]   Multi-Sequence Spreading Random Access (MSRA) for Compressive Sensing-Based Grant-Free Communication [J].
Abebe, Ameha Tsegaye ;
Kang, Chung G. .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (11) :7531-7543
[3]   Logistic Regression Confined by Cardinality-Constrained Sample and Feature Selection [J].
Adeli, Ehsan ;
Li, Xiaorui ;
Kwon, Dongjin ;
Zhang, Yong ;
Pohl, Kilian M. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2020, 42 (07) :1713-1728
[4]   Robust Online Multiuser Detection: A Hybrid Model-Data Driven Approach [J].
Awan, Daniyal Amir ;
Cavalcante, Renato Luis Garrido ;
Yukawa, Masahiro ;
Stanczak, Slawomir .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2023, 71 :2103-2117
[5]  
Candès EJ, 2008, IEEE SIGNAL PROC MAG, V25, P21, DOI 10.1109/MSP.2007.914731
[6]   Sparse Activity Detection for Massive Connectivity [J].
Chen, Zhilin ;
Sohrabi, Foad ;
Yu, Wei .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2018, 66 (07) :1890-1904
[7]   An Efficient Message Passing Algorithm for Active User Detection and Channel Estimation in NOMA [J].
Dai, Weijia ;
Wei, Haichao ;
Zhou, Jiaxi ;
Zhou, Wuyang .
2019 IEEE 90TH VEHICULAR TECHNOLOGY CONFERENCE (VTC2019-FALL), 2019,
[8]   Block-Sparsity-Based Multiuser Detection for Uplink Grant-Free NOMA [J].
Du, Yang ;
Cheng, Cong ;
Dong, Binhong ;
Chen, Zhi ;
Wang, Xiaodong ;
Fang, Jun ;
Li, Shaoqian .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (12) :7894-7909
[9]   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
[10]  
Ghalebi E, 2020, Arxiv, DOI arXiv:1910.05098