Abstract
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 is built using a parallel concatenation of two recursive systematic convolutional codes, and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
Turbo codeSerial concatenated convolutional codesConcatenation (mathematics)Convolutional codeNoisy-channel coding theoremDecoding methodsConcatenated error correction codeEncoderComputer scienceAlgorithmTurbo equalizerCoding (social sciences)Theoretical computer scienceBlock codeArithmeticMathematicsStatistics
Affiliated Institutions
Related Publications
Near optimum error correcting coding and decoding: turbo-codes
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 nonun...
Multilevel diversity coding with distortion
In a Diversity Coding System, an information source is encoded by a number of encoders. There are a number of decoders, each of which can access a certain subset of the encoders...
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 ...
Multilevel trellis coded modulations for the Rayleigh fading channel
The authors present coded 8-phase-shift-keyed (8-PSK) modulations for the Rayleigh fading channel. The schemes are based on multilevel trellis-coded-modulation constructions and...
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...
Publication Info
- Year
- 2002
- Type
- article
- Volume
- 2
- Pages
- 1064-1070
- Citations
- 6631
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
6631
OpenAlex
Cite This
Claude Berrou,
Alain Glavieux,
Punya Thitimajshima
(2002).
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1.
, 2
, 1064-1070.
https://doi.org/10.1109/icc.1993.397441
Identifiers
- DOI
- 10.1109/icc.1993.397441