Spatially Coupled Sparse Code Multiple Access (SC-SCMA): A Spectral Graph Approach

Pei Xiao; Qu Luo; Yiming Gui; Zilong Liu

arxiv: 2606.31743 · v1 · pith:W7Z52LFInew · submitted 2026-06-30 · 📡 eess.SP

Spatially Coupled Sparse Code Multiple Access (SC-SCMA): A Spectral Graph Approach

Yiming Gui , Zilong Liu , Qu Luo , Pei Xiao This is my paper

Pith reviewed 2026-07-01 03:39 UTC · model grok-4.3

classification 📡 eess.SP

keywords sparse code multiple accessspatial couplingspectral graph theoryminimum Euclidean distanceeffective access dimensionalityfactor graphoverloaded channelscodebook design

0 comments

The pith

Spatial coupling in SCMA improves the minimum Euclidean distance by projecting codewords into a higher-dimensional space whose dimensionality is bounded below by the spectral gap of the coupled factor graph.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that spatially coupling SCMA allows the superimposed codewords to occupy a higher effective signal dimension than in standard SCMA. This raises the minimum distance between possible received signals, which directly lowers error rates in heavily loaded channels. The gain is controlled by a quantity called effective access dimensionality that the authors link to the spectral gap of the factor graph using graph theory. They also give a practical way to build the coupling structure and optimize codebooks locally based on this theory. If correct, this approach gives a structural way to design better multiple access schemes without relying solely on simulation.

Core claim

By analyzing pairwise error probabilities for multi-user error patterns, spatial coupling is shown to project the superimposed SCMA codewords into a higher-dimensional effective signal space. This leads to a strictly improved minimum Euclidean distance compared with conventional SCMA. The distance gain is governed by the effective access dimensionality induced by the coupled factor graph. Using spectral graph theory, a direct relationship is established between the spectral gap of the factor graph and a lower bound on the effective access dimensionality, providing a computable metric that guarantees the improvement.

What carries the argument

The effective access dimensionality (EAD) of the coupled factor graph, which determines the minimum Euclidean distance gain, with the spectral gap serving as a lower bound on the EAD.

If this is right

The improved MED enhances error performance in overloaded massive access channels.
Global message propagation from coupling improves coding gain.
Inter-block spreading increases diversity gain.
A low-complexity codebook design is enabled by focusing on dominant error-inducing local user groups.
The spectral gap provides a structural metric for guaranteeing performance.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The spectral graph method could be used to optimize factor graphs in other non-orthogonal multiple access schemes.
Performance gains might extend to scenarios with imperfect channel state information if the EAD bound holds.
This framework suggests that graph design can be separated from codebook optimization for scalable systems.

Load-bearing premise

The pairwise error probability analysis for multi-user error patterns accurately captures the performance improvement from the spectral properties of the factor graph under realistic channel conditions and decoding algorithms.

What would settle it

Compare the actual minimum Euclidean distance achieved in SC-SCMA simulations against the conventional SCMA for factor graphs with different spectral gaps; if the improvement does not scale with the predicted EAD lower bound, the claim would be falsified.

Figures

Figures reproduced from arXiv: 2606.31743 by Pei Xiao, Qu Luo, Yiming Gui, Zilong Liu.

**Figure 2.** Figure 2: OFDM-SCMA architecture featuring various [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗

**Figure 3.** Figure 3: Construction of Spatially Coupled-SCMA via prototype matrix decomposition. [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗

**Figure 4.** Figure 4: Structural-to-Performance Mapping in SC-SCMA. [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗

**Figure 5.** Figure 5: Superposed constellation of multiple colliding users [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗

**Figure 6.** Figure 6: compares the theoretical lower bound N min EAD and the actual NEAD under different overloading ϖ. It is observed that the windowed SCFM provides a much tighter approximation to the true EAD than the conventional SCFM. This is because the windowed structure more accurately captures the localized connectivity induced by spatial coupling, leading to a more precise characterization of the spectral properties. … view at source ↗

**Figure 7.** Figure 7: compares the EAD performance of conventional SCMA and SC-SCMA. It can be observed that SC-SCMA 1 2 3 4 5 6 0 1 2 3 4 5 6 0 2 4 6 8 10 0 1 2 3 4 5 6 7 8 [PITH_FULL_IMAGE:figures/full_fig_p009_7.png] view at source ↗

**Figure 8.** Figure 8: The MED comparison for different codebooks [PITH_FULL_IMAGE:figures/full_fig_p011_8.png] view at source ↗

**Figure 9.** Figure 9: BER performance comparison for different codebooks with [PITH_FULL_IMAGE:figures/full_fig_p012_9.png] view at source ↗

**Figure 10.** Figure 10: BER performance of the proposed codebook in [PITH_FULL_IMAGE:figures/full_fig_p012_10.png] view at source ↗

**Figure 11.** Figure 11: LDPC coded BER performance of proposed codebook ( [PITH_FULL_IMAGE:figures/full_fig_p013_11.png] view at source ↗

read the original abstract

This paper presents a spatially coupled sparse code multiple access (SC-SCMA) framework to overcome the performance and scalability limitations of conventional SCMA systems. By analyzing the pairwise error probability associated to multi-user error patterns, we show that spatial coupling projects the superimposed SCMA codewords into a higher-dimensional effective signal space, leading to a strictly improved minimum Euclidean distance (MED) compared with conventional SCMA, while simultaneously enhancing the coding gain through global message propagation and the diversity gain through inter-block resource spreading. Such a distance gain is shown to be governed by the effective access dimensionality (EAD) induced by the coupled factor graph. With the aid of spectral graph theory, we establish a direct relationship between the spectral gap of the factor graph and a lower bound on the EAD, providing a computable structural metric that guarantees MED improvement under various error patterns. Building upon these theoretical insights, we introduce a low-complexity structure-aware codebook design approach, including a spectral-gap-oriented construction of spatially coupled factor matrices and a localized codebook optimization strategy that exploits the dominant error-inducing local user group. Simulation results validate the analysis and demonstrate that the proposed SC-SCMA consistently outperforms conventional SCMA in overloaded massive access channels.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

SC-SCMA adds spatial coupling and a spectral-gap bound on effective access dimensionality to SCMA, but the claimed MED guarantee appears to depend on the extra localized codebook optimization rather than following directly from the graph construction alone.

read the letter

The main takeaway is that this paper gives a graph-theoretic handle on designing spatially coupled SCMA factor matrices, with a claimed lower bound on effective access dimensionality coming from the spectral gap. That part is new relative to standard SCMA work and the earlier spatially-coupled coding papers they cite.

What the paper does cleanly is lay out how spatial coupling spreads resources across blocks and then ties the factor-graph spectrum to a bound on the minimum Euclidean distance for multi-user error patterns. The abstract frames this as a structural guarantee that holds under various error patterns, and they follow it with a concrete (if low-complexity) codebook construction that uses the same graph.

The soft spot is exactly the one the stress-test flagged. The theoretical section asserts that the spectral gap produces the distance gain through the EAD, yet the actual design also includes a separate localized codebook optimization step that exploits dominant local user groups. If the reported MED improvement only materializes after that optimization, then the spectral metric is more of a design heuristic than an independent guarantee. The simulations are said to validate the analysis, but without seeing the exact comparison (coupled graph alone versus coupled graph plus optimization) it is hard to tell how much of the gain is structural versus tuned.

The math on the pairwise error probability looks standard for this area, and the citation pattern is appropriate. No obvious circularity in the definitions, though the EAD is defined from the coupled graph so the bound is partly by construction.

This is for people already working on non-orthogonal multiple access and 6G waveform design who want a new graph-based knob. It is worth sending to peer review because the framework is coherent on its own terms and the simulations are presented as supporting evidence; a referee can check whether the bound is tight enough to matter in practice and whether the optimization step is doing the heavy lifting.

Referee Report

3 major / 2 minor

Summary. The manuscript proposes a spatially coupled SCMA (SC-SCMA) framework in which spatial coupling of the factor graph projects superimposed codewords into a higher-dimensional effective signal space. It claims this yields a strictly larger minimum Euclidean distance (MED) than conventional SCMA, with the gain governed by an effective access dimensionality (EAD) induced by the coupled graph; spectral graph theory is used to relate the factor-graph spectral gap to a lower bound on EAD that guarantees the improvement under various multi-user error patterns. A low-complexity codebook design (spectral-gap-oriented factor-matrix construction plus localized optimization over dominant local user groups) is introduced, and simulations are said to confirm consistent gains in overloaded massive-access channels.

Significance. If the claimed direct spectral-gap-to-EAD relationship is rigorously established and the MED gain is shown to be a structural consequence of the coupling (independent of the subsequent localized optimization), the work supplies a computable graph-theoretic metric for designing SCMA systems with guaranteed distance improvements. This could be useful for scalable non-orthogonal multiple access, provided the bound is tight enough to affect actual error rates under realistic decoding.

major comments (3)

[Abstract / Theoretical Analysis] Abstract and theoretical analysis section: the central claim that spatial coupling produces a strictly improved MED governed by EAD, with the spectral gap supplying a lower bound that guarantees the gain under multi-user error patterns, is asserted via pairwise error probability analysis, but the explicit derivation of the EAD lower bound, its tightness, and verification that it affects error rates (rather than being loose) are load-bearing and require full expansion.
[Codebook Design] Codebook design section: the construction includes both a spectral-gap-oriented factor-matrix construction and a separate localized codebook optimization that exploits dominant error-inducing local user groups. It must be shown whether the MED improvement is guaranteed by the spectral gap and EAD bound alone, or whether the observed gain requires the optimization step; otherwise the claimed structural guarantee from the graph metric is weaker than stated.
[Pairwise Error Probability Analysis] Pairwise error probability analysis: the analysis for multi-user error patterns is used to establish the higher-dimensional projection and MED gain, yet no explicit check is described that the EAD lower bound is sufficiently tight to produce measurable distance improvement under the actual decoding algorithm and channel conditions employed in the simulations.

minor comments (2)

[Simulations] Simulation results: reporting error bars or results over multiple random seeds would strengthen the validation that the observed gains are consistent with the claimed EAD-driven improvement.
[Notation / Definitions] Notation: the definition of EAD as a function of the coupled factor graph should be stated explicitly before the spectral-gap bound is introduced, to avoid any appearance of circularity in the argument.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive comments. We address each major comment below with clarifications on the theoretical claims and indicate revisions to improve the manuscript.

read point-by-point responses

Referee: [Abstract / Theoretical Analysis] Abstract and theoretical analysis section: the central claim that spatial coupling produces a strictly improved MED governed by EAD, with the spectral gap supplying a lower bound that guarantees the gain under multi-user error patterns, is asserted via pairwise error probability analysis, but the explicit derivation of the EAD lower bound, its tightness, and verification that it affects error rates (rather than being loose) are load-bearing and require full expansion.

Authors: The derivation of the EAD lower bound from the spectral gap appears in Section III-B via the Cheeger inequality applied to the factor graph. We agree that additional intermediate steps and a tightness discussion would strengthen the presentation. In revision we will expand the proof with explicit steps and add a numerical verification showing the bound's effect on error rates. revision: yes
Referee: [Codebook Design] Codebook design section: the construction includes both a spectral-gap-oriented factor-matrix construction and a separate localized codebook optimization that exploits dominant error-inducing local user groups. It must be shown whether the MED improvement is guaranteed by the spectral gap and EAD bound alone, or whether the observed gain requires the optimization step; otherwise the claimed structural guarantee from the graph metric is weaker than stated.

Authors: Theorem 1 shows the MED gain follows directly from the EAD lower bound induced by the spectral gap, independent of optimization. The localized optimization is an implementation step that further improves performance but is not required for the structural guarantee. We will revise Section IV to explicitly separate these elements and add a clarifying remark. revision: yes
Referee: [Pairwise Error Probability Analysis] Pairwise error probability analysis: the analysis for multi-user error patterns is used to establish the higher-dimensional projection and MED gain, yet no explicit check is described that the EAD lower bound is sufficiently tight to produce measurable distance improvement under the actual decoding algorithm and channel conditions employed in the simulations.

Authors: Section V simulations employ the MPA decoder and report gains consistent with the EAD predictions. To make the tightness explicit, we will add a comparison (new figure or table) between the theoretical EAD bound and empirical minimum distances observed under the simulated channel and decoder conditions. revision: yes

Circularity Check

1 steps flagged

EAD defined via coupled factor graph; spectral-gap bound on EAD then used to guarantee MED gain reduces claim to graph construction properties

specific steps

self definitional [Abstract]
"Such a distance gain is shown to be governed by the effective access dimensionality (EAD) induced by the coupled factor graph. With the aid of spectral graph theory, we establish a direct relationship between the spectral gap of the factor graph and a lower bound on the EAD, providing a computable structural metric that guarantees MED improvement under various error patterns."

EAD is defined as induced by the coupled factor graph; the spectral gap is a property of that identical graph. Establishing a 'direct relationship' between the gap and a lower bound on EAD, then claiming the bound guarantees MED improvement, makes the performance claim reduce to a structural property of the graph definition itself rather than an external derivation.

full rationale

The abstract presents the MED improvement as a consequence of spatial coupling into higher-dimensional space, with the gain governed by EAD induced by the coupled factor graph and a direct spectral-gap-to-EAD-bound relationship that 'guarantees' the improvement. Because EAD is introduced as induced by the same graph whose spectral properties supply the bound, the guarantee step is at least partly definitional rather than an independent first-principles derivation from PEP analysis alone. The separate localized codebook optimization is presented as building on the theory, raising the possibility that the claimed structural guarantee is not fully independent of that optimization step. This produces moderate circularity without a full self-citation chain or explicit equation reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The work rests on standard spectral graph theory and domain assumptions about pairwise error events in SCMA; the central new entity (EAD) lacks independent falsifiable evidence outside the paper's own construction.

axioms (2)

domain assumption Pairwise error probability analysis accurately models multi-user error patterns in SCMA
Invoked to establish projection into higher-dimensional space and MED gain
standard math Spectral properties of the factor graph control the effective access dimensionality
Used to link spectral gap to a lower bound on EAD

invented entities (1)

Effective access dimensionality (EAD) no independent evidence
purpose: Quantifies dimension increase from coupling that governs MED improvement
New metric introduced without external validation

pith-pipeline@v0.9.1-grok · 5750 in / 1355 out tokens · 52558 ms · 2026-07-01T03:39:02.190023+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

26 extracted references

[1]

Nonorthogonal multiple access for 5g and beyond,

Y. Liu, Z. Qin, M. Elkashlan, Z. Ding, A. Nallanathan, and L. Hanzo, “Nonorthogonal multiple access for 5g and beyond,” Proc. IEEE, vol. 105, no. 12, pp. 2347–2381, Dec. 2017

2017
[2]

Evolution of NOMA Toward Next Generation Multiple Access (NGMA) for 6G,

Y. Liu, S. Zhang, X. Mu, Z. Ding, R. Schober, N. Al-Dhahir, E. Hossain, and X. Shen, “Evolution of NOMA Toward Next Generation Multiple Access (NGMA) for 6G,” IEEE J. Select. Areas Commun., vol. 40, no. 4, pp. 1037–1071, Apr. 2022

2022
[3]

Sparse or Dense: A Comparative Study of Code-Domain NOMA Systems,

Z. Liu and L.-L. Yang, “Sparse or Dense: A Comparative Study of Code-Domain NOMA Systems,” IEEE Trans. Wireless Commun., vol. 20, no. 8, pp. 4768–4780, Aug. 2021

2021
[4]

Sparse Code Multiple Access for 6G Wireless Communication Networks: Recent Advances and Future Directions,

L. Yu, Z. Liu, M. Wen, D. Cai, S. Dang, Y. Wang, and P. Xiao, “Sparse Code Multiple Access for 6G Wireless Communication Networks: Recent Advances and Future Directions,” IEEE Comm. Stand. Mag., vol. 5, no. 2, pp. 92–99, Jun. 2021

2021
[5]

Sparse code multiple access,

H. Nikopour and H. Baligh, “Sparse code multiple access,” in 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). London: IEEE, Sep. 2013, pp. 332–336

2013
[6]

SCMA Codebook Design,

M. Taherzadeh, H. Nikopour, A. Bayesteh, and H. Baligh, “SCMA Codebook Design,” in 2014 IEEE 80th Vehicular Technology Conference (VTC2014-Fall). Vancouver, BC, Canada: IEEE, Sep. 2014, pp. 1–5

2014
[7]

A Tutorial on Decoding Techniques of Sparse Code Multiple Access,

S. Chaturvedi, Z. Liu, V. A. Bohara, A. Srivastava, and P. Xiao, “A Tutorial on Decoding Techniques of Sparse Code Multiple Access,” IEEE Access, vol. 10, pp. 58 503–58 524, 2022

2022
[8]

Novel Low-Density Signature for Synchronous CDMA Systems Over A WGN Channel,

R. Hoshyar, F. P. Wathan, and R. Tafazolli, “Novel Low-Density Signature for Synchronous CDMA Systems Over A WGN Channel,” IEEE Trans. Signal Process., vol. 56, no. 4, pp. 1616–1626, Apr. 2008

2008
[9]

Designing Enhanced Multidimensional Constellations for Code-Domain NOMA,

H. Wen, Z. Liu, Q. Luo, C. Shi, and P. Xiao, “Designing Enhanced Multidimensional Constellations for Code-Domain NOMA,” IEEE Wireless Commun. Lett., vol. 11, no. 10, pp. 2130–2134, Oct. 2022

2022
[10]

Enhancing Signal Space Diversity for SCMA Over Rayleigh Fading Channels,

Q. Luo, Z. Liu, G. Chen, and P. Xiao, “Enhancing Signal Space Diversity for SCMA Over Rayleigh Fading Channels,” IEEE Trans. Wireless Commun., vol. 23, no. 4, pp. 3676–3690, Apr. 2024

2024
[11]

Design and Analysis of SCMA Codebook Based on Star-QAM Signaling Constellations,

L. Yu, P. Fan, D. Cai, and Z. Ma, “Design and Analysis of SCMA Codebook Based on Star-QAM Signaling Constellations,” IEEE Trans. Veh. Technol., vol. 67, no. 11, pp. 10 543–10 553, Nov. 2018

2018
[12]

Downlink SCMA Codebook Design With Low Error Rate by Maximizing Minimum Euclidean Distance of Superimposed Codewords,

C. Huang, B. Su, T. Lin, and Y. Huang, “Downlink SCMA Codebook Design With Low Error Rate by Maximizing Minimum Euclidean Distance of Superimposed Codewords,” IEEE Trans. Veh. Technol., vol. 71, no. 5, pp. 5231–5245, May 2022

2022
[13]

Multi-Dimensional SCMA Codebook Design Based on Constellation Rotation and Interleaving,

D. Cai, P. Fan, X. Lei, Y. Liu, and D. Chen, “Multi-Dimensional SCMA Codebook Design Based on Constellation Rotation and Interleaving,” in 2016 IEEE 83rd Vehicular Technology Conference (VTC Spring). Nanjing, China: IEEE, May 2016, pp. 1–5

2016
[14]

Design of Power-Imbalanced SCMA Codebook,

X. Li, Z. Gao, Y. Gui, Z. Liu, P. Xiao, and L. Yu, “Design of Power-Imbalanced SCMA Codebook,” IEEE Trans. Veh. Technol., vol. 71, no. 2, pp. 2140–2145, Feb. 2022. 14

2022
[15]

SCMA Codebook Based on Optimization of Mutual Information and Shaping Gain,

S. Sharma, K. Deka, V. Bhatia, and A. Gupta, “SCMA Codebook Based on Optimization of Mutual Information and Shaping Gain,” in 2018 IEEE Globecom Workshops (GC Wkshps). Abu Dhabi, United Arab Emirates: IEEE, Dec. 2018, pp. 1–6

2018
[16]

An Eﬀicient SCMA Codebook Optimization Algorithm Based on Mutual Information Maximization,

C. Dong, G. Gao, K. Niu, and J. Lin, “An Eﬀicient SCMA Codebook Optimization Algorithm Based on Mutual Information Maximization,” Wireless Communications and Mobile Computing, vol. 2018, no. 1, p. 8910907, Jan. 2018

2018
[17]

Bit-Interleaved Coded SCMA With Iterative Multiuser Detection: Multidimensional Constellations Design,

B. Jinchen, Z. Ma, M. Xiao, T. A. Tsiftsis, and Z. Zhongliang, “Bit-Interleaved Coded SCMA With Iterative Multiuser Detection: Multidimensional Constellations Design,” vol. 66, no. 11, pp. 5292–5364, Nov. 2018

2018
[18]

Low Complexity Techniques for SCMA Detection,

A. Bayesteh, H. Nikopour, M. Taherzadeh, H. Baligh, and J. Ma, “Low Complexity Techniques for SCMA Detection,” in 2015 IEEE Globecom Workshops (GC Wkshps). San Diego, CA, USA: IEEE, Dec. 2015, pp. 1–6

2015
[19]

Enabling High Order SCMA Systems in Downlink Scenarios With a Serial Coding Scheme,

Y. Han, W. Zhou, M. Zhao, and S. Zhou, “Enabling High Order SCMA Systems in Downlink Scenarios With a Serial Coding Scheme,” IEEE Access, vol. 6, pp. 33 796–33 809, 2018

2018
[20]

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

Q. Luo, Z. Liu, G. Chen, P. Xiao, Y. Ma, and A. Maaref, “A Design of Low-Projection SCMA Codebooks for Ultra-Low Decoding Complexity in Downlink IoT Networks,” IEEE Trans. Wireless Commun., vol. 22, no. 10, pp. 6608–6623, Oct. 2023

2023
[21]

The effect of spatial coupling on compressive sensing,

S. Kudekar and H. D. Pfister, “The effect of spatial coupling on compressive sensing,” in 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton). Monticello, IL, USA: IEEE, Sep. 2010, pp. 347–353

2010
[22]

Threshold saturation on BMS channels via spatial coupling,

S. Kudekar, C. Meassony, T. Richardson, and R. Urbankez, “Threshold saturation on BMS channels via spatial coupling,” in 2010 6th International Symposium on Turbo Codes & Iterative Information Processing. Brest: IEEE, Sep. 2010, pp. 309–313

2010
[23]

Combining Spatially Coupled LDPC Codes with Modulation and Detection

L. Schmalen, B. Laboratories, and L. Schmalen, “Combining Spatially Coupled LDPC Codes with Modulation and Detection. ”
[24]

Spatially Coupled LDPC Codes Constructed From Protographs,

D. G. M. Mitchell, M. Lentmaier, and D. J. Costello, “Spatially Coupled LDPC Codes Constructed From Protographs,” IEEE Trans. Inform. Theory, vol. 61, no. 9, pp. 4866–4889, Sep. 2015

2015
[25]

Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC,

S. Kudekar, T. J. Richardson, and R. L. Urbanke, “Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC,” IEEE Trans. Inform. Theory, vol. 57, no. 2, pp. 803–834, Feb. 2011

2011
[26]

1st 5g algorithm innovation competition – env1.0-scma,

Altera Innovate Asia, “1st 5g algorithm innovation competition – env1.0-scma,” http://www.innovateasia.com/5G/en/gp2. html, n.d., presentation, Online

[1] [1]

Nonorthogonal multiple access for 5g and beyond,

Y. Liu, Z. Qin, M. Elkashlan, Z. Ding, A. Nallanathan, and L. Hanzo, “Nonorthogonal multiple access for 5g and beyond,” Proc. IEEE, vol. 105, no. 12, pp. 2347–2381, Dec. 2017

2017

[2] [2]

Evolution of NOMA Toward Next Generation Multiple Access (NGMA) for 6G,

Y. Liu, S. Zhang, X. Mu, Z. Ding, R. Schober, N. Al-Dhahir, E. Hossain, and X. Shen, “Evolution of NOMA Toward Next Generation Multiple Access (NGMA) for 6G,” IEEE J. Select. Areas Commun., vol. 40, no. 4, pp. 1037–1071, Apr. 2022

2022

[3] [3]

Sparse or Dense: A Comparative Study of Code-Domain NOMA Systems,

Z. Liu and L.-L. Yang, “Sparse or Dense: A Comparative Study of Code-Domain NOMA Systems,” IEEE Trans. Wireless Commun., vol. 20, no. 8, pp. 4768–4780, Aug. 2021

2021

[4] [4]

Sparse Code Multiple Access for 6G Wireless Communication Networks: Recent Advances and Future Directions,

L. Yu, Z. Liu, M. Wen, D. Cai, S. Dang, Y. Wang, and P. Xiao, “Sparse Code Multiple Access for 6G Wireless Communication Networks: Recent Advances and Future Directions,” IEEE Comm. Stand. Mag., vol. 5, no. 2, pp. 92–99, Jun. 2021

2021

[5] [5]

Sparse code multiple access,

H. Nikopour and H. Baligh, “Sparse code multiple access,” in 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). London: IEEE, Sep. 2013, pp. 332–336

2013

[6] [6]

SCMA Codebook Design,

M. Taherzadeh, H. Nikopour, A. Bayesteh, and H. Baligh, “SCMA Codebook Design,” in 2014 IEEE 80th Vehicular Technology Conference (VTC2014-Fall). Vancouver, BC, Canada: IEEE, Sep. 2014, pp. 1–5

2014

[7] [7]

A Tutorial on Decoding Techniques of Sparse Code Multiple Access,

S. Chaturvedi, Z. Liu, V. A. Bohara, A. Srivastava, and P. Xiao, “A Tutorial on Decoding Techniques of Sparse Code Multiple Access,” IEEE Access, vol. 10, pp. 58 503–58 524, 2022

2022

[8] [8]

Novel Low-Density Signature for Synchronous CDMA Systems Over A WGN Channel,

R. Hoshyar, F. P. Wathan, and R. Tafazolli, “Novel Low-Density Signature for Synchronous CDMA Systems Over A WGN Channel,” IEEE Trans. Signal Process., vol. 56, no. 4, pp. 1616–1626, Apr. 2008

2008

[9] [9]

Designing Enhanced Multidimensional Constellations for Code-Domain NOMA,

H. Wen, Z. Liu, Q. Luo, C. Shi, and P. Xiao, “Designing Enhanced Multidimensional Constellations for Code-Domain NOMA,” IEEE Wireless Commun. Lett., vol. 11, no. 10, pp. 2130–2134, Oct. 2022

2022

[10] [10]

Enhancing Signal Space Diversity for SCMA Over Rayleigh Fading Channels,

Q. Luo, Z. Liu, G. Chen, and P. Xiao, “Enhancing Signal Space Diversity for SCMA Over Rayleigh Fading Channels,” IEEE Trans. Wireless Commun., vol. 23, no. 4, pp. 3676–3690, Apr. 2024

2024

[11] [11]

Design and Analysis of SCMA Codebook Based on Star-QAM Signaling Constellations,

L. Yu, P. Fan, D. Cai, and Z. Ma, “Design and Analysis of SCMA Codebook Based on Star-QAM Signaling Constellations,” IEEE Trans. Veh. Technol., vol. 67, no. 11, pp. 10 543–10 553, Nov. 2018

2018

[12] [12]

Downlink SCMA Codebook Design With Low Error Rate by Maximizing Minimum Euclidean Distance of Superimposed Codewords,

C. Huang, B. Su, T. Lin, and Y. Huang, “Downlink SCMA Codebook Design With Low Error Rate by Maximizing Minimum Euclidean Distance of Superimposed Codewords,” IEEE Trans. Veh. Technol., vol. 71, no. 5, pp. 5231–5245, May 2022

2022

[13] [13]

Multi-Dimensional SCMA Codebook Design Based on Constellation Rotation and Interleaving,

D. Cai, P. Fan, X. Lei, Y. Liu, and D. Chen, “Multi-Dimensional SCMA Codebook Design Based on Constellation Rotation and Interleaving,” in 2016 IEEE 83rd Vehicular Technology Conference (VTC Spring). Nanjing, China: IEEE, May 2016, pp. 1–5

2016

[14] [14]

Design of Power-Imbalanced SCMA Codebook,

X. Li, Z. Gao, Y. Gui, Z. Liu, P. Xiao, and L. Yu, “Design of Power-Imbalanced SCMA Codebook,” IEEE Trans. Veh. Technol., vol. 71, no. 2, pp. 2140–2145, Feb. 2022. 14

2022

[15] [15]

SCMA Codebook Based on Optimization of Mutual Information and Shaping Gain,

S. Sharma, K. Deka, V. Bhatia, and A. Gupta, “SCMA Codebook Based on Optimization of Mutual Information and Shaping Gain,” in 2018 IEEE Globecom Workshops (GC Wkshps). Abu Dhabi, United Arab Emirates: IEEE, Dec. 2018, pp. 1–6

2018

[16] [16]

An Eﬀicient SCMA Codebook Optimization Algorithm Based on Mutual Information Maximization,

C. Dong, G. Gao, K. Niu, and J. Lin, “An Eﬀicient SCMA Codebook Optimization Algorithm Based on Mutual Information Maximization,” Wireless Communications and Mobile Computing, vol. 2018, no. 1, p. 8910907, Jan. 2018

2018

[17] [17]

Bit-Interleaved Coded SCMA With Iterative Multiuser Detection: Multidimensional Constellations Design,

B. Jinchen, Z. Ma, M. Xiao, T. A. Tsiftsis, and Z. Zhongliang, “Bit-Interleaved Coded SCMA With Iterative Multiuser Detection: Multidimensional Constellations Design,” vol. 66, no. 11, pp. 5292–5364, Nov. 2018

2018

[18] [18]

Low Complexity Techniques for SCMA Detection,

A. Bayesteh, H. Nikopour, M. Taherzadeh, H. Baligh, and J. Ma, “Low Complexity Techniques for SCMA Detection,” in 2015 IEEE Globecom Workshops (GC Wkshps). San Diego, CA, USA: IEEE, Dec. 2015, pp. 1–6

2015

[19] [19]

Enabling High Order SCMA Systems in Downlink Scenarios With a Serial Coding Scheme,

Y. Han, W. Zhou, M. Zhao, and S. Zhou, “Enabling High Order SCMA Systems in Downlink Scenarios With a Serial Coding Scheme,” IEEE Access, vol. 6, pp. 33 796–33 809, 2018

2018

[20] [20]

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

Q. Luo, Z. Liu, G. Chen, P. Xiao, Y. Ma, and A. Maaref, “A Design of Low-Projection SCMA Codebooks for Ultra-Low Decoding Complexity in Downlink IoT Networks,” IEEE Trans. Wireless Commun., vol. 22, no. 10, pp. 6608–6623, Oct. 2023

2023

[21] [21]

The effect of spatial coupling on compressive sensing,

S. Kudekar and H. D. Pfister, “The effect of spatial coupling on compressive sensing,” in 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton). Monticello, IL, USA: IEEE, Sep. 2010, pp. 347–353

2010

[22] [22]

Threshold saturation on BMS channels via spatial coupling,

S. Kudekar, C. Meassony, T. Richardson, and R. Urbankez, “Threshold saturation on BMS channels via spatial coupling,” in 2010 6th International Symposium on Turbo Codes & Iterative Information Processing. Brest: IEEE, Sep. 2010, pp. 309–313

2010

[23] [23]

Combining Spatially Coupled LDPC Codes with Modulation and Detection

L. Schmalen, B. Laboratories, and L. Schmalen, “Combining Spatially Coupled LDPC Codes with Modulation and Detection. ”

[24] [24]

Spatially Coupled LDPC Codes Constructed From Protographs,

D. G. M. Mitchell, M. Lentmaier, and D. J. Costello, “Spatially Coupled LDPC Codes Constructed From Protographs,” IEEE Trans. Inform. Theory, vol. 61, no. 9, pp. 4866–4889, Sep. 2015

2015

[25] [25]

Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC,

S. Kudekar, T. J. Richardson, and R. L. Urbanke, “Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC,” IEEE Trans. Inform. Theory, vol. 57, no. 2, pp. 803–834, Feb. 2011

2011

[26] [26]

1st 5g algorithm innovation competition – env1.0-scma,

Altera Innovate Asia, “1st 5g algorithm innovation competition – env1.0-scma,” http://www.innovateasia.com/5G/en/gp2. html, n.d., presentation, Online