articleTop 1% cited

Near optimum error correcting coding and decoding: turbo-codes

IEEE Transactions on Communications · 1996 · Vol. 44(10) · pp. 1261–1271

Claude Berrou✉(École nationale supérieure de techniques avancées Bretagne)Alain Glavieux(École nationale supérieure de techniques avancées Bretagne)

View via DOI Publisher page

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.

Advanced Wireless Communication Techniques Error Correcting Code Techniques Coding theory and cryptographyTurbo codeSerial concatenated convolutional codesConcatenated error correction codeConvolutional codeInterleavingBCJR algorithmComputer scienceConcatenation (mathematics)Turbo equalizerBlock code

Citations

2,748

FWCI

37.78

field-weighted impact

References

Percentile

100%

vs. same field & year

Citations per year

Cited by

Good error-correcting codes based on very sparse matrices