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

Simple item page
dc.creatorNguyen, Khoa D.
dc.creatorFabregas, Albert Guillen i
dc.creatorRasmussen, Lars K.
dc.date2007-05-02
dc.date2007-07-04
dc.date.accessioned2026-07-07T08:16:01Z
dc.date.available2026-07-07T08:16:01Z
dc.descriptionWe 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.
dc.description6 pages, 4 figures, submitted to Information Theory Workshop 2007
dc.identifierhttps://arxiv.org/abs/0705.0252
dc.identifierhttp://arxiv.org/abs/0705.0252
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133642
dc.subjectInformation Theory
dc.titlePower Allocation for Discrete-Input Non-Ergodic Block-Fading Channels
dc.typetext

Files

Collections

arXiv