TY - GEN
T1 - Sparse Vector Coding Based Massive Grant-Free Access for Short-Packet Communication in IIoT
AU - Luo, Yingzhe
AU - Zhu, Xu
AU - Zhang, Yanfeng
AU - Guo, Ziming
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - In industrial Internet of Things (IIoT), short-packet communication requires higher reliability and lower latency, enabling Grant-free (GF) access in massive machine-type communication (mMTC) to gain a tremendous research interest. However, in practical applications, the accurate channel state information (CSI) required by coherent GF (C-GF) is challenging to acquire. Concurrently, the spectral efficiency and reliability of the non-coherent (NC-GF) scheme are areas necessitating enhancement. Inspired by sparse vector coding (SVC), this paper introduces an innovative SVC-GF scheme. This scheme redefines joint user activity detection (UAD) and data decoding as a bifurcated sparse recovery issue. A novel block refinement orthogonal matching pursuit and multipath matching pursuit (BROMP-MMP) algorithm is designed to resolve this intricate problem. Simulation results demonstrate that the proposed SVC-GF scheme outperforms traditional C-GF and NC-GF schemes in terms of probability of successful detection and average block error rate (BLER) performance, heralding a paradigm shift for massive GF access.
AB - In industrial Internet of Things (IIoT), short-packet communication requires higher reliability and lower latency, enabling Grant-free (GF) access in massive machine-type communication (mMTC) to gain a tremendous research interest. However, in practical applications, the accurate channel state information (CSI) required by coherent GF (C-GF) is challenging to acquire. Concurrently, the spectral efficiency and reliability of the non-coherent (NC-GF) scheme are areas necessitating enhancement. Inspired by sparse vector coding (SVC), this paper introduces an innovative SVC-GF scheme. This scheme redefines joint user activity detection (UAD) and data decoding as a bifurcated sparse recovery issue. A novel block refinement orthogonal matching pursuit and multipath matching pursuit (BROMP-MMP) algorithm is designed to resolve this intricate problem. Simulation results demonstrate that the proposed SVC-GF scheme outperforms traditional C-GF and NC-GF schemes in terms of probability of successful detection and average block error rate (BLER) performance, heralding a paradigm shift for massive GF access.
KW - industrial Internet of Things (IIoT)
KW - massive grant-free (GF) access
KW - short-packet communication
KW - sparse vector coding (SVC)
UR - https://www.scopus.com/pages/publications/85202795004
U2 - 10.1109/ICC51166.2024.10622836
DO - 10.1109/ICC51166.2024.10622836
M3 - 会议稿件
AN - SCOPUS:85202795004
T3 - IEEE International Conference on Communications
SP - 5395
EP - 5400
BT - ICC 2024 - IEEE International Conference on Communications
A2 - Valenti, Matthew
A2 - Reed, David
A2 - Torres, Melissa
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 59th Annual IEEE International Conference on Communications, ICC 2024
Y2 - 9 June 2024 through 13 June 2024
ER -