The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Multiuser Detection of Sparsely Spread CDMA
Abstract
Code-division multiple access (CDMA) is the basis of a family of advanced air interfaces in current and future generation networks. The benefits promised by CDMA have not been fully realized partly due to the prohibitive complexity of optimal detection and decoding of many users communicating simultaneously using the same frequency band. From both theoretical and practical perspectives, this paper advocates a new paradigm of CDMA with sparse spreading sequences, which enables near-optimal multiuser detection using belief propagation (BP) with low-complexity. The scheme is in part inspired by capacity-approaching low-density parity-check (LDPC) codes and the success of iterative decoding techniques. Specifically, it is shown that BP-based detection is optimal in the large-system limit under many practical circumstances, which is a unique advantage of sparsely spread CDMA systems. Moreover, it is shown that, from the viewpoint of an individual user, the CDMA channel is asymptotically equivalent to a scalar Gaussian channel with some degradation in the signal-to-noise ratio (SNR). The degradation factor, known as the multiuser efficiency, can be determined from a fixed-point equation. The results in this paper apply to a broad class of sparse, semi-regular CDMA systems with arbitrary input and power distribution. Numerical results support the theoretical findings for systems of moderate size, which further demonstrate the appeal of sparse spreading in practical applications.
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 1×
“The BP algorithm [18], also known as the sum-product algorithm [19], [20], can thus be derived from”
Method
Cited by
A Survey of Non-Orthogonal Multiple Access for 5G
Dai, L., Wang, B., Ding, Z., Wang, Z., Chen, S., & Hanzo, L. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2835558 · Cited by 1,327
Bayesian Compressive Sensing Via Belief Propagation
Baron, D., Sarvotham, S., & Baraniuk, R. G. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2027773 · Cited by 498
Grant-Free Non-Orthogonal Multiple Access for IoT: A Survey
Shahab, M. B., Abbas, R., Shirvanimoghaddam, M., & Johnson, S. J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2996032 · Cited by 453
Metadata
- Authors
- Guo, D., & Wang, C.-C.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2008-04
- Volume
- 26
- Issue
- 3
- Pages
- 421-431
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2144015943
- Cited by
- 173
- References
- 1
- FWCI
- 17.01
- Type
- journal article
- Language
- en
- Open access
- closed
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: Multiuser Detection of Sparsely Spread CDMA. https://app.cochat.ai/papers/10.1109/jsac.2008.080402
- The paper
- Guo, D., & Wang, C.-C. (2008). Multiuser Detection of Sparsely Spread CDMA. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2008.080402
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.