The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Iterative decoding of binary block and convolutional codes
Abstract
Iterative decoding of two-dimensional systematic convolutional codes has been termed "turbo" (de)coding. Using log-likelihood algebra, we show that any decoder can be used which accepts soft inputs-including a priori values-and delivers soft outputs that can be split into three terms: the soft channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a priori value for the next iteration. Decoding algorithms in the log-likelihood domain are given not only for convolutional codes but also for any linear binary systematic block code. The iteration is controlled by a stop criterion derived from cross entropy, which results in a minimal number of iterations. Optimal and suboptimal decoders with reduced complexity are presented. Simulation results show that very simple component codes are sufficient, block codes are appropriate for high rates and convolutional codes for lower rates less than 2/3. Any combination of block and convolutional component codes is possible. Several interleaving techniques are described. At a bit error rate (BER) of 10/sup -4/ the performance is slightly above or around the bounds given by the cutoff rate for reasonably simple block/convolutional component codes, interleaver sizes less than 1000 and for three to six iterations.
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
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
Forney, G. D. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9030 · Cited by 5,647
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
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,623
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
Error-Correction Coding for Digital Communications
Clark, G. C., & Cain, J. B. (1981) · Springer eBooks · doi:10.1007/978-1-4899-2174-1 · Cited by 1,317
Source-controlled channel decoding
Hagenauer, J. (1995) · IEEE Transactions on Communications · doi:10.1109/26.412719 · Cited by 448
Self-citationNear optimum decoding of product codes
Pyndiah, R. M., Glavieux, A., Picart, A., & Jacq, S. (2002) · Globecom · doi:10.1109/glocom.1994.513494 · Cited by 291
Capacity of channels with uncoded side information
Shamai, S. S., & Verdú, S. (1995) · European Transactions on Telecommunications · doi:10.1002/ett.4460060514 · Cited by 70
Decoding via cross-entropy minimization
Moher, M. (2002) · Globecom · doi:10.1109/glocom.1993.318192 · Cited by 60
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
Achieving near-capacity on a multiple-antenna channel
Hochwald, B. M., & ten Brink, S. (2003) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.809789 · Cited by 2,033
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
Chung, S.-Y., Forney, G. D., Richardson, T. J., & Urbanke, R. (2001) · IEEE Communications Letters · doi:10.1109/4234.905935 · Cited by 1,539
Low-density parity-check codes based on finite geometries: a rediscovery and new results
Kou, Y., Lin, S., & Fossorier, M. P. C. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959255 · Cited by 1,302
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
Metadata
- Authors
- Hagenauer, J., Offer, E., & Papke, L.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1996-03
- Volume
- 42
- Issue
- 2
- Pages
- 429-445
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2146694142
- Cited by
- 2,303
- References
- 10
- FWCI
- 64.88
- 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.