Power allocation for discrete-input non-ergodic block-fading channels
Files
(Published version)
Date
2007
Authors
Nguyen, D.K.
Guillen i Fabregas, A.
Rasmussen, L.
Editors
Pradhan, P.
S, S.
S, S.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
2007 ITW: Information Theory Workshop: Proceedings, 2007 / Pradhan, P., S, S. (ed./s), pp.48-53
Statement of Responsibility
Conference Name
2007 IEEE Information Theory Workshop (ITW '07) (2 Sep 1907 - 6 Sep 1907 : Tahoe City, CA, USA)
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 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. © 2007 IEEE.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2007 IEEE