We obtain an accurate and simple analytical approximation to the bit error probability of
maximum-likelihood decoding of parallel concatenated convolutional codes (turbo-codes) …

We derive the ensemble weight enumeration function of turbo-codes, where the ensemble is
generated by a uniform choice over the interleaver and a uniform choice over the …

Serial concatenation of convolutional codes separated by an interleaver has recently been
shown, through the use of upper bounds to the maximum likelihood performance, to be …

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 …

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 …

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 …

Turbo codes, in the form of parallel concatenated convolutional codes, consist of two
recursive systematic convolutional encoders separated by an interleaver. Due to the …

The idea of iterative decoding of two-dimensional systematic convolutional codes-so-called
turbo-codes-is extended to threshold decoding, which is presented in" soft-in/soft-out" form …

This article presents a tutorial overview of the class of concatenated convolutional codes
with interleavers, also known as turbo-like codes. They are powerful codes, formed by a …

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 …