Low complexity receiver of sparse code multiple access based on dynamic trellis

Peng, Xiaohuan; Pan, Zhipeng; Lai, Ke; Wen, Li; Lei, Jing

doi:10.1049/iet-com.2019.0719

“…The standard MPA has M d f search paths, which In [86], the truncation parameter m c is fixed, which makes the BER performance loss for EML-MPA. To strike a balance between BER and complexity, [87] proposed a dynamic trellis based MPA (DT-MPA). In DT-MPA, the parameter m c decreases as the number of iterations increases.…”

Section: E Extended Max-log Mpamentioning

confidence: 99%

A Tutorial on Decoding Techniques of Sparse Code Multiple Access

Chaturvedi

¹

,

Liu

²

,

Srivastava

³

et al. 2022

View full text Add to dashboard Cite

Sparse Code Multiple Access (SCMA) is a disruptive code-domain non-orthogonal multiple access (NOMA) scheme to enable future massive machine-type communication networks. As an evolved variant of code division multiple access (CDMA), multiple users in SCMA are separated by assigning distinctive sparse codebooks (CBs). Efficient multiuser detection is carried out at the receiver by employing the message passing algorithm (MPA) that exploits the sparsity of CBs to achieve error performance approaching to that of the maximum likelihood receiver. In spite of numerous research efforts in recent years, a comprehensive one-stop tutorial of SCMA covering the background, the basic principles, and new advances, is still missing, to the best of our knowledge. To fill this gap and to stimulate more forthcoming research, we provide a holistic introduction to the principles of SCMA encoding, CB design, and MPA based decoding in a self-contained manner. As an ambitious paper aiming to push the limits of SCMA, we present a survey of advanced decoding techniques with brief algorithmic descriptions as well as several promising directions.

show abstract

“…In [86], the truncation parameter m c is fixed, which makes the BER performance loss for EML-MPA. To strike a balance between BER and complexity, [87] proposed a dynamic trellis based MPA (DT-MPA). In DT-MPA, the parameter m c decreases as the number of iterations increases.…”

Section: E Extended Max-log Mpamentioning

confidence: 99%

A Tutorial on Decoding Techniques of Sparse Code Multiple Access

Chaturvedi¹,

Liu²,

Srivastava³

et al. 2022

Preprint

0

View full text Add to dashboard Cite

Sparse Code Multiple Access (SCMA) is a disruptive code-domain non-orthogonal multiple access (NOMA) scheme to enable future massive machine-type communication networks. As an evolved variant of code division multiple access (CDMA), multiple users in SCMA are separated by assigning distinctive sparse codebooks (CBs). Efficient multiuser detection is carried out at the receiver by employing the message passing algorithm (MPA) that exploits the sparsity of CBs to achieve error performance approaching to that of the maximum likelihood receiver. In spite of numerous research efforts in recent years, a comprehensive one-stop tutorial of SCMA covering the background, the basic principles, and new advances, is still missing, to the best of our knowledge. To fill this gap and to stimulate more forthcoming research, we provide a holistic introduction to the principles of SCMA encoding, CB design, and MPA based decoding in a self-contained manner. As an ambitious paper aiming to push the limits of SCMA, we present a survey of advanced decoding techniques with brief algorithmic descriptions as well as several promising directions.

show abstract

“…After the maximum number of iterations, the codewords of all users will be finally determined. In [122], [123], the authors introduced a SCMA trellis representation after mapping SCMA constellation to a Galois field. Based on the introduced trellis representation, a low-complexity truncatedmessages based decoding method was proposed.…”

Section: Definitionsmentioning

confidence: 99%

Sparse Code Multiple Access: Potentials and Challenges

Rebhi

¹

,

Hassan

²

,

Raoof

³

et al. 2021

IEEE Open J. Commun. Soc.

View full text Add to dashboard Cite

The massive connectivity is among other unprecedented requirements which are expected to be satisfied in order to follow the perpetual increase of connected devices in the era of internet of things. In contrast to the family of conventional orthogonal multiple access schemes, the key distinguishing feature of non-orthogonal multiple access (NOMA) is its capacity to support the massive connectivity. Sparse code multiple access (SCMA) is one of the powerful schemes of code-domain NOMA (CD-NOMA) and is among the promising candidates of multiple access techniques to be employed in future generations of wireless communication systems thanks to the sparsity pattern of its codebooks. This technique has been actively investigated in recent years. In this paper, we provide a comprehensive survey of the state-of-the-art of SCMA. First, we will pinpoint SCMA place in the NOMA landscape including power-domain NOMA and CD-NOMA with the aim of justifying why SCMA is prominent. Then, its system architecture is highlighted and its basic principles are presented, afterwards a review of exiting codebook designs and available SCMA detectors is provided, before showing how resources are expected to be assigned, and how SCMA can be combined with other existing and emerging technologies. Finally, we present a range of future research trends and challenging open issues that should be addressed to optimize SCMA performance.

show abstract

Low complexity receiver of sparse code multiple access based on dynamic trellis

Cited by 7 publications

References 20 publications

A Tutorial on Decoding Techniques of Sparse Code Multiple Access

A Tutorial on Decoding Techniques of Sparse Code Multiple Access

A Tutorial on Decoding Techniques of Sparse Code Multiple Access

Sparse Code Multiple Access: Potentials and Challenges

Contact Info

Product

Resources

About