Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Bit-Interleaved Coded Modulation
Foundations and Trends in Communications and Information Theory
Fast communication: Best antenna selection for coded SIMO-OFDM
Signal Processing
A channel representation method for the study of hybrid retransmission-based error control
IEEE Transactions on Communications
Coding and decoding for the dynamic decode and forward relay protocol
IEEE Transactions on Information Theory
Coded modulation with mismatched power control over block-fading channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Outage analysis of the hybrid free-space optical and radio-frequency channel
IEEE Journal on Selected Areas in Communications - Special issue on optical wireless communications
Symbol-level adaptive modulation for coded OFDM on block fading channels
IEEE Transactions on Communications
Outage probability of the free-space optical channel with doubly stochastic scintillation
IEEE Transactions on Communications
Bit-interleaved coded modulation for hybrid RF/FSO systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Performance of hybrid-ARQ in block-fading channels: a fixed outage probability analysis
IEEE Transactions on Communications
Outage exponents of block-fading channels with power allocation
IEEE Transactions on Information Theory
Low-density parity-check codes for nonergodic block-fading channels
IEEE Transactions on Information Theory
Coded modulation with mismatched CSIT over MIMO block-fading channels
IEEE Transactions on Information Theory
Hi-index | 755.08 |
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 per complex dimension, over a finite signal set χ⊆C of size 2M, achieve the optimal rate-diversity tradeoff given by the Singleton bound δ(N,M,R)=1+└N(1-R/M)┘, for R∈(0,M┘. Furthermore, we show also that the popular bit-interleaved coded modulation achieves 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 χ⊂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 additive white Gaussian noise (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 (SNR) 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.