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 …

A new class of convolutional codes called turbo-codes, whose performances in terms of bit
error rate (BER) are close to the Shannon limit, is discussed. The turbo-code encoder is built …

A parallel concatenated coding scheme consists of two simple constituent systematic
encoders linked by an interleaver. The input bits to the first encoder are scrambled by the …

Turbo codes, first presented to the coding community in 1993 [1],[2], represent one of the
most important breakthroughs in coding since Ungerboeck introduced trellis codes in 1982 …

Recursive systematic convolutional encoders have been shown to play a crucial role in the
design of turbo codes. We recall some properties of binary convolutional encoders and …

The goal of this article is to describe the main ideas behind the new class of codes called
turbo codes, whose performance in terms of bit error probability has been shown to be very …

For understanding turbo codes, we propose to locate them at the intersection of three main
topics: the random-like criterion for designing codes, the idea of extending the decoding role …

In this article, we design new turbo codes that can achieve near-Shannon-limit performance.
The design criterion for random interleavers is based on maximizing the effective free …

A parallel concatenated convolutional coding scheme consists of two constituent systematic:
convolutional encoders linked by an interleaver. The information bits at the input of the first …

The original turbo codes (TCs), presented in 1993 by Berrou et al., consist of the parallel
concatenation of two rate-1/2 binary recursive systematic convolutional (RSC) codes. This …