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 …

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 …

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 …

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 …

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 …

This book provides a comprehensive overview of the subject of channel coding. It starts with
a description of information theory, focusing on the quantitative measurement of information …

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 …

While improved bounds have been central to proofs of the coding theorem and the tightness
of the random coding bound for rates near capacity, most results for specific codes, both …

We track the density of extrinsic information in iterative turbo decoders by actual density
evolution, and also approximate it by symmetric Gaussian density functions. The …

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 …