Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels

Details Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels

2007-05-02

arxiv.org/abs/0705.0252v3

Computer Science

Information Theory

6 pages, 4 figures, submitted to Information Theory Workshop 2007

Scientific paper

We consider power allocation algorithms for fixed-rate transmission over Nakagami-m non-ergodic block-fading channels with perfect transmitter and receiver channel state information and discrete input signal constellations under both short- and long-term power constraints. Optimal power allocation schemes are shown to be direct applications of previous results in the literature. We show that the SNR exponent of the optimal short-term scheme is given by the Singleton bound. We also illustrate the significant gains available by employing long-term power constraints. Due to the nature of the expressions involved, the complexity of optimal schemes may be prohibitive for system implementation. We propose simple sub-optimal power allocation schemes whose outage probability performance is very close to the minimum outage probability obtained by optimal schemes.

Affiliated with

Also associated with

No associations

Rating

Power Allocation for Discrete-Input Non-Ergodic 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 Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-674567