The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Low Complexity Iterative Receiver Design for Sparse Code Multiple Access
Open accessAbstract
Sparse code multiple access (SCMA) is one of the most promising methods among all the non-orthogonal multiple access techniques in the future 5G communication. Compared with some other non-orthogonal multiple access techniques, such as low density signature, SCMA can achieve better performance due to the shaping gain of the SCMA code words. However, despite the sparsity of the code words, the decoding complexity of the current message passing algorithm utilized by SCMA is still prohibitively high. In this paper, by exploring the lattice structure of SCMA code words, we propose a low-complexity decoding algorithm based on list sphere decoding (LSD). The LSD avoids the exhaustive search for all possible hypotheses and only considers signal within a hypersphere. As LSD can be viewed a depth-first tree search algorithm, we further propose several methods to prune the redundancy-visited nodes in order to reduce the size of the search tree. Simulation results show that the proposed algorithm can reduce the decoding complexity substantially while the performance loss compared with the existing algorithm is negligible.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
Cited by
Massive Access for 5G and Beyond
Chen, X., Ng, D. W. K., Yu, W., Larsson, E. G., Al-Dhahir, N., & Schober, R. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3019724 · Cited by 681
A Survey of NOMA: Current Status and Open Research Challenges
Makki, B., Chitti, K., Behravan, A., & Alouini, M.-S. (2020) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2020.2969899 · Cited by 487
Impact of Non-Orthogonal Multiple Access on the Offloading of Mobile Edge Computing
Ding, Z., Fan, P., & Poor, H. V. (2019) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2870894 · Cited by 263
Metadata
- Authors
- Wei, F., & Chen, W.
- Venue
- IEEE Transactions on Communications
- Published
- 2017-02
- Volume
- 65
- Issue
- 2
- Pages
- 621-634
- ISSN
- 0090-6778 (ISSN-L)
- 1558-0857
- OpenAlex
- W3007990687
- Cited by
- 160
- References
- 1
- FWCI
- 10.52
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Low Complexity Iterative Receiver Design for Sparse Code Multiple Access. https://app.cochat.ai/papers/10.1109/tcomm.2016.2631468
- The paper
- Wei, F., & Chen, W. (2017). Low Complexity Iterative Receiver Design for Sparse Code Multiple Access. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2016.2631468
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.