Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Tutorial to Sparse Code Multiple Access (2105.06860v1)

Published 14 May 2021 in cs.IT, eess.SP, and math.IT

Abstract: Sparse Code Multiple Access (SCMA) is an enabling code-domain non-orthogonal multiple access (NOMA)scheme for massive connectivity and ultra low-latency in future machine-type communication networks. As an evolved variant of code division multiple access (CDMA), multiple users in SCMA are separated by assigning distinctive codebooks which display certain sparsity. At an SCMA receiver, efficient multiuser detection is carried out by employing the message passing algorithm (MPA) which exploits the sparsity of codebooks to achieve error rate performance approaching to that of the maximum likelihood receiver. Despite numerous research efforts on SCMA in recent years, a comprehensive and in-depth tutorial to SCMA is missing, to the best of our knowledge. To fill this gap and to stimulate more forthcoming research, we introduce the principles of SCMA encoding, codebook design, and MPA based decoding in a self-contained manner for layman researchers and engineers.

Citations (5)

Summary

We haven't generated a summary for this paper yet.