TY - JOUR
T1 - Two-stage Active User Detection with False Alarm Correction for GF-NOMA System
AU - Yang, Linjie
AU - Fan, Pingzhi
AU - Li, Li
AU - Ding, Zhiguo
AU - Hao, Li
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2024
Y1 - 2024
N2 - Grant-free (GF) low-density signature orthogonal frequency division multiplexing (LDS-OFDM) is one of the most generic grant-free non-orthogonal multiple access (GF-NOMA) schemes. This paper proposes a two-stage active user detection (AUD) consisting of the initial AUD stage and the false alarm correction stage. In the initial AUD stage, an initial active user set is efficiently estimated by the conventional cover decoder, which may still contain a few false alarms. Hence, a false alarm correction stage is further invoked, which consists of two cooperative and iterative detection components, namely, message passing algorithm (MPA) based data decoder and belief propagation (BP) based false alarm corrector. Based on users' signature spreading sequences in the initial active user set, a tanner graph with potential redundant-edges is constructed, on which MPA is executed for data decoding. In turn, with the aid of decoded data symbols, the remaining false alarms in the initial active user set are further removed by the false alarm corrector. Hence, the tanner graph could evolve iteratively. Furthermore, the false alarm performance of the initial AUD stage is theoretically analyzed. Based on this analysis, the LDS matrix used in GF LDS-OFDM is optimized. Finally, the complexity of our proposal is also provided.
AB - Grant-free (GF) low-density signature orthogonal frequency division multiplexing (LDS-OFDM) is one of the most generic grant-free non-orthogonal multiple access (GF-NOMA) schemes. This paper proposes a two-stage active user detection (AUD) consisting of the initial AUD stage and the false alarm correction stage. In the initial AUD stage, an initial active user set is efficiently estimated by the conventional cover decoder, which may still contain a few false alarms. Hence, a false alarm correction stage is further invoked, which consists of two cooperative and iterative detection components, namely, message passing algorithm (MPA) based data decoder and belief propagation (BP) based false alarm corrector. Based on users' signature spreading sequences in the initial active user set, a tanner graph with potential redundant-edges is constructed, on which MPA is executed for data decoding. In turn, with the aid of decoded data symbols, the remaining false alarms in the initial active user set are further removed by the false alarm corrector. Hence, the tanner graph could evolve iteratively. Furthermore, the false alarm performance of the initial AUD stage is theoretically analyzed. Based on this analysis, the LDS matrix used in GF LDS-OFDM is optimized. Finally, the complexity of our proposal is also provided.
KW - Grant-free
KW - LDS-OFDM
KW - MPA
KW - false alarm correction
KW - group testing
UR - http://www.scopus.com/inward/record.url?scp=85183660810&partnerID=8YFLogxK
U2 - 10.1109/TWC.2024.3354956
DO - 10.1109/TWC.2024.3354956
M3 - Article
AN - SCOPUS:85183660810
SN - 1536-1276
VL - 23
SP - 8836
EP - 8851
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 8
ER -