Coded diversity on block-fading channels
Authors:
- H. LeibHLH. Leib
- 1 March 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (2) , 771-781
Abstract
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 schemesKeywords
This publication has 10 references indexed in Scilit:
- Letter: On the capacity of the binary input gaussian and rayleigh fading channelsEuropean Transactions on Telecommunications, 1996
- An advanced TDMA mobile access system for UMTSIEEE Wireless Communications, 1995
- On the design and selection of convolutional codes for an uninterleaved, bursty Rician channelIEEE Transactions on Communications, 1995
- Information theoretic considerations for cellular mobile radioIEEE Transactions on Vehicular Technology, 1994
- The performance of convolutional codes on the block erasure channel using various finite interleaving techniquesIEEE Transactions on Information Theory, 1994
- Multifrequency trellis coding with low delay for fading channelsIEEE Transactions on Communications, 1993
- Two new coding techniques for diversity communication systemsIEEE Transactions on Communications, 1990
- The design of trellis coded MPSK for fading channels: performance criteriaIEEE Transactions on Communications, 1988
- On the converse to the coding theorem for discrete memoryless channels (Corresp.)IEEE Transactions on Information Theory, 1973
- A Gaussian channel with slow fading (Corresp.)IEEE Transactions on Information Theory, 1970