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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal-supelec.archives-ouvertes.fr/hal-00328178
Contributor : Samir Medina Perlaza <>
Submitted on : Thursday, October 9, 2008 - 8:33:00 PM
Last modification on : Wednesday, May 16, 2018 - 5:08:03 PM
Long-term archiving on : Monday, June 7, 2010 - 5:59:37 PM

File

C6.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00328178, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

373

Files downloads

544