Near optimum error correcting coding and decoding: turbo-codes

Author

Berrou, Claude ; Glavieux, Alain

Author_Institution

Ecole Nat. Superieure des Telecommun. de Bretagne, Brest, France

Volume

44

Issue

10

fYear

1996

fDate

10/1/1996 12:00:00 AM

Firstpage

1261

Lastpage

1271

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

codecs; convolutional codes; decoding; error correction codes; interleaved codes; iterative methods; concatenation; convolutional codes; correcting performance; extrinsic information; iterative processing; near optimum error correcting coding; near optimum error correcting decoding; nonuniform interleaving; recursive systematic codes; turbo-codes; Bit error rate; Channel coding; Convolution; Convolutional codes; Error correction; Interleaved codes; Iterative decoding; Modulation coding; Silicon; Turbo codes;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.539767

Filename

539767