The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Convergence of iterative decoding
Abstract
A novel method for visualising the convergence behaviour of iterative decoding schemes is proposed. Each constituent decoder is represented by a mutual information transfer characteristic which describes the flow of extrinsic information through the soft in/soft out decoder. The exchange of extrinsic information between constituent decoders is plotted in an extrinsic information transfer chart. The concepts are illustrated for an iterative demapping and decoding scheme.
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
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Berrou, C., Glavieux, A., & Thitimajshima, P. (2002) · Proceedings of ICC '93 - IEEE International Conference on Communications · doi:10.1109/icc.1993.397441 · Cited by 6,738
A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
Robertson, P., Villebrun, E., & Hoeher, P. (2002) · Proceedings IEEE International Conference on Communications ICC '95 · doi:10.1109/icc.1995.524253 · Cited by 1,695
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
Benedetto, S., Divsalar, D., Montorsi, G., & Pollara, F. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.669119 · Cited by 1,261
Hamming, R. W. (1980) · Cited by 693
Cited by
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
Self-citationTowards 6G wireless communication networks: vision, enabling technologies, and new paradigm shifts
You, X., Wang, C.-X., Huang, J., Gao, X., Zhang, Z., Wang, M., Huang, Y., Zhang, C., Jiang, Y., Wang, J., et al. (2021) · Science China Information Sciences · doi:10.1007/s11432-020-2955-6 · Cited by 2,027
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
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
Self-citationLiu, Y., Tan, Z., Hu, H., Cimini, L. J., & Li, G. Y. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2320074 · Cited by 394
The Art of Error Correcting Coding
Morelos‐Zaragoza, R. H. (2002) · Wiley eBooks · doi:10.1002/0470847824 · Cited by 376
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 282
Design of repeat-accumulate codes for iterative detection and decoding
ten Brink, S., & Kramer, G. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.818250 · Cited by 258
Self-citation
Metadata
- Authors
- ten Brink, S.
- Venue
- Electronics Letters
- Published
- 1999-05-13
- Volume
- 35
- Issue
- 10
- Pages
- 806-808
- ISSN
- 0013-5194 (ISSN-L)
- 1350-911X
- OpenAlex
- W2159059820
- Cited by
- 575
- References
- 4
- FWCI
- 19.68
- 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.