The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Turbo equalization
Abstract
Turbo equalization is an iterative equalization and decoding technique that can achieve equally impressive performance gains for communication systems that send digital data over channels that require equalization, i.e., those that suffer from intersymbol interference (ISI). In this article, we discuss the turbo equalization approach to coded data transmission over ISI channels, with emphasis on the basic ideas and some of the practical details. The original system introduced by Douillard et al. can be viewed as an extension of the turbo decoding algorithm by considering the effect of the ISI channel as another form of error protection, i.e., as a rate-1 convolutional code.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
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
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
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
An Introduction to Signal Detection and Estimation
Poor, H. V. (1994) · Springer Texts in Electrical Engineering · doi:10.1007/978-1-4757-2341-0 · Cited by 2,659
Forney, G. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054829 · Cited by 2,461
Unveiling turbo codes: some results on parallel concatenated coding schemes
Benedetto, S., & Montorsi, G. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485713 · Cited by 1,142
An Introduction to factor graphs
Loeliger, H. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1267047 · Cited by 905
Cited by
Performance of iterative decision feedback channel estimation in turbo FDE for DFT-spread OFDM
Mori, C., Sawahashi, M., Miki, N., & Suyama, S. (2025) · IEICE Transactions on Communications · doi:10.23919/transcom.2024ebp3052 · Cited by 2
Metadata
- Authors
- Koetter, R., Singer, A. C., & Tuchler, M.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2004-01
- Volume
- 21
- Issue
- 1
- Pages
- 67-80
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W4235954034
- Cited by
- 423
- References
- 14
- FWCI
- 31.39
- 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: Turbo equalization. https://app.cochat.ai/papers/10.1109/msp.2004.1267050
- The paper
- Koetter, R., Singer, A. C., & Tuchler, M. (2004). Turbo equalization. IEEE Signal Processing Magazine. https://doi.org/10.1109/msp.2004.1267050
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.