Abstract
This paper presents a new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving. Decoding calls on iterative processing in which each component decoder takes advantage of the work of the other at the previous step, with the aid of the original concept of extrinsic information. For sufficiently large interleaving sizes, the correcting performance of turbo-codes, investigated by simulation, appears to be close to the theoretical limit predicted by Shannon.
Keywords
Turbo codeSerial concatenated convolutional codesConcatenated error correction codeConvolutional codeInterleavingBCJR algorithmComputer scienceConcatenation (mathematics)Turbo equalizerBlock codeAlgorithmDecoding methodsLinear codeTheoretical computer scienceSequential decodingElectronic engineeringComputer engineeringArithmeticMathematicsEngineering
Affiliated Institutions
Related Publications
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. The turbo-code encoder i...
Good error-correcting codes based on very sparse matrices
We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay-Neal (1995)) codes are recently invented, and "Gallager codes" were first ...
Codes and iterative decoding on general graphs
Abstract A general framework, based on ideas of Tanner, for the description of codes and iterative decoding (“turbo coding”) is developed. Just like trellis‐based code descripti...
Iterative decoding of compound codes by probability propagation in graphical models
We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (Markov ra...
Codes and Decoding on General Graphs
Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particular, the recent success of turbo codes indicates that ...
Publication Info
- Year
- 1996
- Type
- article
- Volume
- 44
- Issue
- 10
- Pages
- 1261-1271
- Citations
- 2739
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2739
OpenAlex
Cite This
Claude Berrou,
Alain Glavieux
(1996).
Near optimum error correcting coding and decoding: turbo-codes.
IEEE Transactions on Communications
, 44
(10)
, 1261-1271.
https://doi.org/10.1109/26.539767
Identifiers
- DOI
- 10.1109/26.539767