1996•IEEE Transactions on CommunicationsRequires access

Near optimum error correcting coding and decoding: turbo-codes

Claude Berrou, Alain Glavieux

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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2769 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Turbo code, Serial concatenated convolutional codes, Concatenated error correction code, Convolutional code, Interleaving, BCJR algorithm, Computer science, Concatenation (mathematics)