Wireless communications systems and networks
Performance of Coded Cooperative Diversity with Interference in Nakagami Fading Environments
Wireless Personal Communications: An International Journal
Bit-Interleaved Coded Modulation
Foundations and Trends in Communications and Information Theory
Code rate-diversity-multiplexing tradeoff
IEEE Transactions on Information Theory
Outage behavior of discrete memoryless channels under channel estimation errors
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
Symbol-level adaptive modulation for coded OFDM on block fading channels
IEEE Transactions 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
Convolutionally coded transmission over Markov-Gaussian channels: analysis and decoding metrics
IEEE Transactions on Communications
Low-density parity-check codes for nonergodic block-fading channels
IEEE Transactions on Information Theory
Diversity analysis of bit-interleaved coded multiple beamforming
IEEE Transactions on Communications
Amplify-and-forward two-way relay networks: error exponents and resource allocation
IEEE Transactions on Communications
Array Processing for Multi-User Multi-Antenna Interference Channels Using Precoders
Wireless Personal Communications: An International Journal
Hi-index | 755.08 |
This paper considers coded diversity schemes over block-fading Rician channels using random coding techniques. Two random coding upper bounds on the error probability of block codes are derived: a new bound and a simpler but looser bound assuming binary input distribution. Also, a new lower bound for any block code is derived using the strong converse to channel coding theorem. The lower bound shows that the new random coding upper bound is quite tight. Furthermore, it is shown that the maximum achievable diversity order in a block-fading channel with finite interleaving depends not only on the number of subchannels L, but also on the code rate R and that the performance can only marginally be improved by increasing the block length of the code. The random coding upper bound and the lower bound are shown to converge to the capacity outage for large channel block lengths N, demonstrating that the capacity outage can be used for estimating the error probability of coded diversity schemes