The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Iterative multiuser joint decoding: unified framework and asymptotic analysis
Abstract
We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algorithm. In this framework, known parallel and serial, hard and soft interference cancellation algorithms are derived in a unified way. The asymptotic performance of these algorithms in the limit of large code block length can be rigorously analyzed by using density evolution. We show that, for random spreading in the large-system limit, density evolution is considerably simplified. Moreover, by making a Gaussian approximation of the decoder soft output, we show that the behavior of iterative multiuser joint decoding is approximately characterized by the stable fixed points of a simple one-dimensional nonlinear dynamical system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
(1988) · Cited by 16,582
Warnes, L. A. A. (1994) · Electronic and Electrical Engineering · doi:10.1007/978-1-349-13012-2_24 · Cited by 6,512
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
PE, & Billingsley, P. (1996) · Journal of the American Statistical Association · doi:10.2307/2291440 · Cited by 6,481
Elements of Applied Bifurcation Theory
Kuznetsov, Y. A. (2004) · Applied Mathematical Sciences · doi:10.1007/978-1-4757-3978-7 · Cited by 5,564
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
Bahl, L., Cocke, J., Jelinek, F., & Raviv, J. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055186 · Cited by 5,208
Verdú, S. (1998) · Cited by 4,682
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,623
Cited by
Random Matrix Theory and Wireless Communications
Tulino, A. M., & Verdú, S. (2004) · Foundations and Trends™ in Communications and Information Theory · doi:10.1561/0100000001 · Cited by 2,034
Bit-interleaved coded modulation
Caire, G., Taricco, G., & Biglieri, E. (2002) · Proceedings of IEEE International Symposium on Information Theory · doi:10.1109/isit.1997.613011 · Cited by 1,927
Self-citationDonoho, D. L., Tsaig, Y., Drori, I., & Starck, J.-L. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173241 · Cited by 1,509
Interleave division multiple-access
Ping, L., Liu, L., Wu, K., & Leung, W. K. (2006) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2006.1618943 · Cited by 912
Extrinsic information transfer functions: model and erasure channel properties
Ashikhmin, A., Kramer, G., & ten Brink, S. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.836693 · Cited by 756
Novel Low-Density Signature for Synchronous CDMA Systems Over AWGN Channel
Hoshyar, R., Wathan, F. P., & Tafazolli, R. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.909320 · Cited by 654
The Factor Graph Approach to Model-Based Signal Processing
Loeliger, H.-A., Dauwels, J., Hu, J., Korl, S., Ping, L., & Kschischang, F. R. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.896497 · Cited by 526
On the Effectiveness of OTFS for Joint Radar Parameter Estimation and Communication
Gaudio, L., Kobayashi, M., Caire, G., & Colavolpe, G. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.2998583 · Cited by 444
Self-citationMessage Passing Algorithms for Scalable Multitarget Tracking
Meyer, F., Kropfreiter, T., Williams, J. L., Lau, R., Hlawatsch, F., Braca, P., & Win, M. Z. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2789427 · Cited by 355
Bilinear Generalized Approximate Message Passing—Part I: Derivation
Parker, J. T., Schniter, P., & Cevher, V. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2357776 · Cited by 281
Metadata
- Authors
- Boutros, J., & Caire, G.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2002-07
- Volume
- 48
- Issue
- 7
- Pages
- 1772-1793
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2165942867
- Cited by
- 314
- References
- 27
- FWCI
- 24.75
- 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
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.