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

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

2007-07-11

arxiv.org/abs/0707.1588v1

Computer Science

Information Theory

22 pages, 4 figures. This work has been accepted for IEEE Transactions on Information Theory and has been presented in part at

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-434830