The ensemble performance of parallel and serial concatenated turbo codes is considered,
where the ensemble is generated by a uniform choice of the interleaver and of the …

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

The performance of maximum-likelihood (ML) decoded binary linear block codes is
addressed via the derivation of tightened upper bounds on their decoding error probability …

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 …

The transmission of coded communication systems is widely modeled to take place over a
set of parallel channels. This model is used for transmission over block-fading channels, rate …

We consider coded modulation schemes for the block-fading channel. In the setting where a
codeword spans a finite number N of fading degrees of freedom, we show that coded …

This paper is devoted to a Shannon-theoretic study of turbo codes. We prove that ensembles
of parallel and serial turbo codes are" good" in the following sense. For a turbo code …

An optimal interleaving between two component encoders of a turbo‐code is proposed. The
optimally criterion for any real constructable interleaver is given. For component codes with …

We derive here improved upper bounds on the decoding error probability of block codes
which are transmitted over fully interleaved Rician fading channels, coherently detected and …

Concatenated coding schemes with interleavers consist of a combination of two simple
constituent encoders and an interleaver. The parallel concatenation known as “turbo code” …