pith. sign in

arxiv: 0705.0252 · v3 · submitted 2007-05-02 · 💻 cs.IT · math.IT

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

classification 💻 cs.IT math.IT
keywords powerallocationoptimalschemesblock-fadingchannelsconstraintslong-term
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.