This paper elaborates on the idea of building grant-free channel access schemes from non-orthogonal multiple access ones, and proposes an explicit such scheme based on sparse code multiple access (SCMA). In the designed protocol, SCMA codebooks and pilots are chosen by users in a fully uncoordinated fashion, with multiple pilots associated with the same codebook to aid codebook detection. A modified two-stage SCMA decoder is proposed, where a low-complexity collision resolution algorithm, working on a super-constellation, and an SCMA message passing detector are iteratively applied. Numerical results, integrated by analysis in the high signal-to-noise ratio regime, highlight a potential for the proposed scheme in the context of massive uncoordinated machine-type uplink.
Mirri, A., Forlivesi, D., Valentini, L., Chiani, M., Paolini, E. (2024). An SCMA-Based Grant-Free Access Scheme. NEW YORK, NY, USA : Institute of Electrical and Electronics Engineers Inc. [10.1109/wcnc57260.2024.10570968].
An SCMA-Based Grant-Free Access Scheme
Mirri, Alessandro;Forlivesi, Diego;Valentini, Lorenzo;Chiani, Marco;Paolini, Enrico
2024
Abstract
This paper elaborates on the idea of building grant-free channel access schemes from non-orthogonal multiple access ones, and proposes an explicit such scheme based on sparse code multiple access (SCMA). In the designed protocol, SCMA codebooks and pilots are chosen by users in a fully uncoordinated fashion, with multiple pilots associated with the same codebook to aid codebook detection. A modified two-stage SCMA decoder is proposed, where a low-complexity collision resolution algorithm, working on a super-constellation, and an SCMA message passing detector are iteratively applied. Numerical results, integrated by analysis in the high signal-to-noise ratio regime, highlight a potential for the proposed scheme in the context of massive uncoordinated machine-type uplink.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


