Coded modulation in the block-fading channel: coding theorems and code construction

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 modulations of rate R bit/complex dimension, over a finite signal set X C of size 2M, achieve the optimal rate-diversity tradeoff given by the Singleton bound (N;M;R) = 1+bN(1 _R=M)c, for R 2 (0;M]. Furthermore, we show also that the popular bit-interleaved coded modulation achieve the same optimal rate-diversity tradeoff. We present a novel coded modulation construction based on blockwise concatenation that systematically yields Singleton-bound achieving turbo-like codes defined over an arbitrary signal set X _ C. The proposed blockwise concatenation significantly outperforms conventional serial and parallel turbo codes in the block-fading channel. We analyze the ensemble average performance under Maximum-Likelihood (ML) decoding of the proposed codes by means of upper bounds and tight approximations. We show that, differently from the AWGN and fully-interleaved fading cases, Belief-Propagation iterative decoding performs very close to ML on the block-fading channel for any signal-to-noise ratio and even for relatively short block lengths. We also show that, at constant decoding complexity per information bit, the proposed codes perform close to the information outage probability for any block length, while standard block codes (e.g., obtained by trellis-termination of convolutional codes) have a gap from outage that increases with the block length: this is a different and more subtle manifestation of the so-called \interleaving gain" of turbo codes.