Iterative Mercury/waterfilling for Parallel Multiple Access Channels - CentraleSupélec Access content directly
Conference Papers Year : 2008

Iterative Mercury/waterfilling for Parallel Multiple Access Channels

Abstract

This paper describes a power allocation strategy for fixed constellation over parallel Gaussian channels in the multiuser context. The criterion under consideration is mutual information, given arbitrary input distributions over users and over subcarriers. The algorithm achieves with very low complexity the multi-user aggregate sum mutual information upper bound. The algorithm is based on an iterative Mercury/waterfilling procedure. Moreover, we extend the framework to a decentralized scenario using a linear approximation of the MMSE function. We show, in particular that each user can, under certain assumptions, independently determine the power allocation without knowing the channel information of other users. Simulation results validate the theoretical claims.
Fichier principal
Vignette du fichier
C6.pdf (136.41 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00328178 , version 1 (09-10-2008)

Identifiers

  • HAL Id : hal-00328178 , version 1

Cite

He Gaoning, Sophie Gault, Merouane Debbah, Eitan Altman. Iterative Mercury/waterfilling for Parallel Multiple Access Channels. ICC 2008, May 2008, China. 5 p. ⟨hal-00328178⟩
120 View
530 Download

Share

Gmail Mastodon Facebook X LinkedIn More