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 nonuniform interleaving. Decoding calls on iterative processing in which each component decoder takes advantage of the work of t...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 44; no. 10; pp. 1261 - 1271
Main Authors Berrou, C., Glavieux, A.
Format Journal Article
LanguageEnglish
Published IEEE 01.10.1996
Subjects
Bit error rate
Channel coding
Convolution
Convolutional codes
Error correction
Interleaved codes
Iterative decoding
Modulation coding
Silicon
Turbo codes
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/26.539767