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,665
Design of capacity-approaching irregular low-density parity-check codes
Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910578 · Cited by 3,335
A recursive approach to low complexity codes
Tanner, R. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056404 · Cited by 3,138
The capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
Near optimum error correcting coding and decoding: turbo-codes
Berrou, C., & Glavieux, A. (1996) · IEEE Transactions on Communications · doi:10.1109/26.539767 · Cited by 2,761
Convergence behavior of iteratively decoded parallel concatenated codes
ten Brink, S. (2001) · IEEE Transactions on Communications · doi:10.1109/26.957394 · Cited by 2,386
Iterative decoding of binary block and convolutional codes
Hagenauer, J., Offer, E., & Papke, L. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485714 · Cited by 2,303
Fading channels: information-theoretic and communications aspects
Biglieri, E., Proakis, J., & Shamai, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720551 · Cited by 1,931
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-citationElements of Applied Bifurcation Theory
(1998) · Applied Mathematical Sciences · doi:10.1007/b98848 · Cited by 1,635
Multistage detection in asynchronous code-division multiple-access communications
Varanasi, M. K., & Aazhang, B. (1990) · IEEE Transactions on Communications · doi:10.1109/26.52662 · Cited by 1,259
Chaghaghi, F. S., & Billingsley, P. (1986) · The Statistician · doi:10.2307/2987970 · Cited by 1,217
Spectral efficiency of CDMA with random spreading
Verdu, S., & Shamai, S. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.749007 · Cited by 885
An iterative multiuser decoder for near-capacity communications
Moher, M. (1998) · IEEE Transactions on Communications · doi:10.1109/26.701309 · Cited by 360
Codes and iterative decoding on general graphs
Wiberg, N., Loeliger, H., & Kotter, R. (1995) · European Transactions on Telecommunications · doi:10.1002/ett.4460060507 · Cited by 314
Iterative multiuser receivers for CDMA channels: an EM-based approach
Nelson, L. B., & Poor, H. V. (1996) · IEEE Transactions on Communications · doi:10.1109/26.545900 · Cited by 198
Output MAI distributions of linear MMSE multiuser receivers in DS-CDMA systems
Zhang, J., Chong, E. K. P., & Tse, D. N. C. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.915669 · Cited by 172
Successive interference cancellation with SISO decoding and EM channel estimation
Kobayashi, M., Boutros, J., & Caire, G. (2001) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.942508 · Cited by 170
Self-citation
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
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.