Block Iterative Support Detection for Uplink Grant-Free MIMO-NOMA
Document Type
Article
Publication Date
1-1-2025
Abstract
Grant-Free-Non-orthogonal multiple access (GF-NOMA) is a powerful means to reduce signaling overhead, provide a large number of connections, and support low latency requirements in 6G Internet of Things applications. However, the accuracy of multi-user detection (MUD) remains a challenge. In this paper, we propose a Block Iterative Support Detection (BISD) MUD algorithm for GF-NOMA, which exploits the spatial diversity gain and block sparsity provided by multiple-input multiple-output (MIMO) to improve the MUD accuracy of the traditional Iterative Support Detection (ISD) algorithm. The proposed BISD algorithm efficiently updates the active support set by block-wise non-zero judgment in each iteration to improve detection accuracy. Simulation results show that BISD improves the detection performance with faster convergence speed, compared with ISD and other traditional MUD algorithms for GF-NOMA.
Publication Source (Journal or Book title)
IEEE Wireless Communications Letters
Recommended Citation
Lei, R., Zhang, X., Shi, F., Zhou, X., Zhou, Z., & Liu, J. (2025). Block Iterative Support Detection for Uplink Grant-Free MIMO-NOMA. IEEE Wireless Communications Letters https://doi.org/10.1109/LWC.2025.3541419
