A Design of Low-Projection SCMA Codebooks for Ultra-Low Decoding Complexity in Downlink IoT Networks

This paper conceives a novel sparse code multiple access (SCMA) codebook design which is motivated by the strong need for providing ultra-low decoding complexity and good error performance in downlink Internet-of-things (IoT) networks, in which a massive number of low-end and low-cost IoT communicat...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications Vol. 22; no. 10; p. 1
Main Authors: Luo, Qu, Liu, Zilong, Chen, Gaojie, Xiao, Pei, Ma, Yi, Maaref, Amine
Format: Journal Article
Language:English
Published: New York IEEE 01.10.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
codebook design
Codes
Complex numbers
Complexity
Complexity theory
Decoding
Downlink
Downlinking
Error analysis
Euclidean geometry
golden angle modulation (GAM)
Internet of Things
Internet-of-things (IoT)
low complexity detection
Modulation
NOMA
Optimization
Rician channels
Sparse code multiple access (SCMA)
ISSN:1536-1276, 1558-2248
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper conceives a novel sparse code multiple access (SCMA) codebook design which is motivated by the strong need for providing ultra-low decoding complexity and good error performance in downlink Internet-of-things (IoT) networks, in which a massive number of low-end and low-cost IoT communication devices are served. By focusing on the typical Rician fading channels, we analyze the pair-wise error probability of superimposed SCMA codewords and then deduce the design metrics for multi-dimensional constellation construction and sparse codebook optimization. For significant reduction of the decoding complexity, we advocate the key idea of projecting the multi-dimensional constellation elements to a few overlapped complex numbers in each dimension, called low projection (LP). An emerging modulation scheme, called golden angle modulation (GAM), is considered for multi-stage LP optimization, where the resultant multi-dimensional constellation is called LP-GAM. Our analysis and simulation results show the superiority of the proposed LP codebooks (LPCBs) including one-shot decoding convergence and excellent error rate performance. In particular, the proposed LPCBs lead to decoding complexity reduction by at least 97% compared to that of the conventional codebooks, whilst owning large minimum Euclidean distance. Some examples of the proposed LPCBs are available at https://github.com/ethanlq/SCMA-codebook.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2023.3244868