---
title: Sparse Code Multiple Access (SCMA)
url: https://www.emergentmind.com/topics/sparse-code-multiple-access-scma
type: topic
---

# Sparse Code Multiple Access (SCMA)

Sparse Code Multiple Access (SCMA) is a code-domain non-orthogonal multiple access (NOMA) scheme that enables massive connectivity and high spectral efficiency in 5G and future wireless networks. SCMA achieves this by mapping user data directly onto sparse, multi-dimensional codewords drawn from user-specific codebooks, allowing multiple users to share physical resources in a highly overloaded manner while maintaining tractable receiver complexity via message passing detection that exploits codeword sparsity. SCMA supports flexible system trade-offs between throughput, latency, receiver complexity, and reliability and is extensible to hybrid NOMA frameworks and next-generation wireless contexts.

## 1. Fundamentals and System Model

SCMA generalizes CDMA by mapping bits into $K$-dimensional sparse codewords $x_j \in \mathbb{C}^K$ with only $d_v \ll K$ nonzero entries, rather than spreading symbols along dense sequences. For an uplink/downlink block, $J$ users (layers) simultaneously transmit on $K$ orthogonal resource elements (REs), yielding an overloading factor $\lambda = J/K > 1$ [1408.3653][2002.12121][2104.01402]. Each user $j$ uses a codebook $\mathcal{C}_j$ of $M$ codewords, where each codeword $x_{j,m}$ is assigned a specific 'support pattern': a binary indicator $f_j \in \{0,1\}^K$ that specifies the nonzero positions.

The received signal model is:
$$
\mathbf{y} = \sum_{j=1}^J \mathrm{diag}(\mathbf{h}_j) \mathbf{x}_j + \mathbf{n}
$$
where $\mathbf{h}_j \in \mathbb{C}^K$ denotes the channel gains for user $j$ and $\mathbf{n} \sim \mathcal{CN}(0, N_0 \mathbf{I}_K)$ is additive white Gaussian noise. In the multiuser scenario, the system is succinctly represented by a bipartite factor graph, where user nodes (VNs) are connected to resource nodes (FNs) via edges defined by the codeword sparsity [1408.3653][2205.07456].

## 2. SCMA Codebook Design and Factor Graph Construction

Central to SCMA is the design of multi-dimensional sparse codebooks that maximize system performance, particularly under realistic channel conditions [2002.12121][2403.16826][2010.03329][1408.3653]. Each user's codebook is constructed via permutation and rotation of a lattice-based or constellation-based mother codebook (e.g., rotated QAM, Star-QAM, low-projection-PAM). The codebook design objectives include:

- **Maximizing minimum Euclidean distance** $d_{\min}$ among all superimposed codewords to minimize pairwise error probability, significant at moderate SNR.
- **Maximizing minimum product distance** for fading/ergodic channels to ensure diversity [2010.03329][2403.16826].
- **Shaping gain**: Utilizing non-cubic, rotationally-optimized constellations for improved performance over simple QAM repetition (as in LDS).
- **Control of codeword sparsity**: The support pattern matrix $F \in \{0,1\}^{K \times J}$ is constructed so that each column (user) has $d_v$ ones, and each row (RE) has $d_f$ ones, where $d_f = (J d_v) / K$ [2104.01402][2002.12121][1408.3653].
- **Power imbalance**: Introducing varying energy per nonzero dimension to further maximize the minimum distance in the superimposed constellation, especially in downlink [2010.03329].

Optimization methods for codebook construction include sequential quadratic programming [2403.16826], genetic algorithms [2010.03329], differential evolution [2003.03569], and deep-learning-based autoencoders [2204.08286][1906.03169]. The factor graph defines the message passing schedule in the receiver and governs user-per-resource collision properties.

## 3. Message Passing Algorithms and Detection

Multiuser detection in SCMA leverages the sparsity of codewords by employing the message passing algorithm (MPA) over the constructed factor graph [1408.3653][2002.12121][2205.07456]. Belief propagation alternates between:

- **FN-to-VN update** (function/resource node to user node): For each resource, the message is a sum-product (or max-product in the log-domain) marginalization over all possible symbol combinations for users colliding on that RE, weighted by the observation likelihood and prior messages.
- **VN-to-FN update**: For each user, the outgoing message is the product of incoming messages (excluding the current resource node), reflecting extrinsic information.

The per-iteration complexity is $\mathcal{O}(K d_f M^{d_f})$, where $d_f$ is the per-resource degree, and $M$ is the constellation size. For moderate $d_f$ and $M$, the complexity is feasible even with overloading.

Variants to further reduce complexity include:

- **List sphere decoding (LSD)**: Replaces full marginalization with a sphere search in the lattice space, with pruning and complexity tunability [2002.12181].
- **Max-Log and log-domain approximations**: Substitute sum-exponentials in MPA with max-operations and limited Jacobian corrections [1804.00180][1508.00679].
- **Early termination, schedule-based, and variable alphabet truncation** [1804.00180][2205.07456].
- **Deep learning-based decoders**: DNNs or autoencoders can learn SCMA decoding and sometimes jointly optimize codebooks and decoding mappings, yielding improved BER-SNR efficiency [2204.08286][1906.03169].

## 4. System Performance, Overloading, and Hybrid SCMA-NOMA

SCMA achieves high spectral efficiency and user connectivity:

- **Overloading**: Systems routinely support $\lambda = J/K$ in $[1.5, 2]$ range (i.e., serving 150–200% as many users as physical resources). For example, 6 users over 4 dimensions, with $d_v=2$, $d_f=3$ [1408.3653][2104.01402][2309.09127]. Spectral efficiency scales with overloading as $\eta = (J/K) \log_2 M$ bits/s/Hz.
- **Error-rate performance**: Well-designed codebooks yield shaping gains of 1–2 dB over LDS for the same loading and up to 3 dB over OFDMA/SC-FDMA for BLER in the $10^{-3}–10^{-4}$ range [1408.3653][2104.01402].
- **Hybrid access**: SCMA is synergistically combined with power-domain NOMA (HMA), multi-user CoMP, and other NOMA/OMA coexistence mechanisms for massive user support and flexible rate adaptation [2309.09127][1404.5605][2411.08520][1504.01747].
- **Phase noise**: Phase-noise-resilient codebook designs (via optimized metrics such as MPNM) mitigate PN-induced detection errors, increasing robustness under practical RF conditions [2501.16823].

## 5. Advanced Frameworks: Grant-Free Access, OTFS-SCMA, and Adaptive Modulation

SCMA is deployed in grant-free massive access, 6G architectures, and high-mobility contexts:

- **Grant-Free SCMA**: Designed for uplink mMTC, where user activity is random and unknown a priori. Joint belief propagation and expectation propagation enable joint activity detection and decoding, often resolving resource collisions with ACK-feedback loops and iterative remapping [2002.12121].
- **OTFS-SCMA**: SCMA codebooks are applied as inner code to OTFS modulation for robust high-mobility communications. Channel estimation via convolutional sparse coding exploits codebook-induced pilot sparsity, allowing scalable estimation overhead independent of user count [2107.09893].
- **Variable/Adaptive Modulation SCMA (VM-SCMA/AVM-SCMA)**: Permits per-user modulation order/codebook size, adaptive to user channel conditions and targeted throughput. Optimization jointly addresses codebook assignment, power, and mapping under average inverse product distance and throughput bounds [2411.08520].
- **Visible-Light and mmWave SCMA**: Extensions to real-valued, nonnegative or beam-space codewords for optical or directional mmWave networks [2104.01402].

## 6. Hardware Architectures and Implementation

The structured sparsity of SCMA codebooks and message passing makes it amenable to low-complexity hardware implementation:

- **Deterministic message passing (DMPA)**: VLSI architectures exploit pipelining and folding to achieve multi-Gbps throughput with sub-10 μs latency for moderate-size systems (e.g., $J=6$, $K=4$), meeting 3GPP eMBB requirements [1804.00180]. Max-Log and approximation techniques permit arithmetic reduction by factors exceeding $\times50$ versus full floating-point MPA.
- **Parallelization**: The resource and layer node computations map to pipeline and SIMD structures.
- **Early termination, damping, domain-specific acceleration**: These further minimize energy and computation for wireless hardware.

## 7. Research Directions and Open Challenges

Continued research focuses on multiple axes:

- **Large-scale codebook optimization**: For high-dimensional SCMA, scalable combinatorial or ML-based search for optimal codebooks remains open [2205.07456][2204.08286].
- **Unified blind and grant-free detection**: Integrating activity, channel, and data inference in compressed-sensing–like or probabilistic frameworks [2002.12121].
- **Synchronization and asynchrony**: Robust MPA against timing/frequency offsets and phase noise [2501.16823][2205.07456].
- **Cross-layer resource allocation**: Dynamic codebook/user-layer mapping, scheduling, and joint SCMA/OMA operations under QoS and latency constraints [1404.5605][2411.08520].
- **Deep learning integration**: Large-scale, online adaptive autoencoder codebook/decoder pairs for evolving channel, interference, and hardware conditions [2204.08286][1906.03169].
- **Grant-free and RIS-aided extensions**: Design under intelligent reflecting surfaces and ultra-dense, distributed architectures [2104.01402].
- **SCMA for high-mobility and new physical layers**: SCMA-OTFS, visible light, and mmWave combinations for vehicular, IoT, and beyond-5G/6G scenarios [2104.01402][2107.09893].

SCMA thus constitutes a principal code-domain NOMA solution for future wireless, with robust mathematical underpinnings, demonstrated practical performance, and a rich suite of open algorithmic and implementation research problems [1408.3653][2002.12121][2104.01402][2002.12181][2204.08286][2205.07456][2411.08520][1804.00180][1508.00679][2010.03329][2403.16826][2501.16823][2107.09893].

Source: https://www.emergentmind.com/topics/sparse-code-multiple-access-scma