A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels

Authors:
K. D. Nguyen;A. Guillen i Fabregas;L. K. Rasmussen
Affiliations:
-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 4

Power allocation for block-fading channels with arbitrary input constellations

IEEE Transactions on Wireless Communications
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 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

Quantified Score

Hi-index	754.96

Visualization

Abstract

In this correspondence, a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels is proposed. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity tradeoff for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.