Near optimum error correcting coding and decoding: turbo-codes
Claude Berrou, Alain Glavieux · IEEE Transactions on Communications · 1996
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.
Cited by 2,762 works. doi:10.1109/26.539767
Authors
References
- The viterbi algorithm
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- Optimal decoding of linear codes for minimizing symbol error rate
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
- Channel coding with multilevel/phase signals
- Near Shannon limit error-correcting coding and decoding : Turbo-codes
- Principles of digital communication and coding
- Convolutional Codes and Their Performance in Communication Systems
- High-Rate Punctured Convolutional Codes for Soft Decision Viterbi Decoding
- Punctured convolutional codes of rate(n-1)/nand simplified maximum likelihood decoding (Corresp.)