A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels
arXiv:0707.1588 · doi:10.1109/TIT.2007.907520
Abstract
In this correspondence, we propose a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity trade-off for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.
22 pages, 4 figures. This work has been accepted for IEEE Transactions on Information Theory and has been presented in part at the 2007 IEEE International Symposium on Information Theory, Nice, France, June 2007
Cited by in corpus (5)
- Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
- Macro and Micro Diversity Behaviors of Practical Dynamic Decode and Forward Relaying schemes
- Coded Modulation with Mismatched CSIT over Block-Fading Channels
- Time-Varying Space-Only Codes for Coded MIMO
- Multi-User MIMO Scheduling in the Fourth Generation Cellular Uplink