Iterative waterfilling for weighted rate sum maximization in MIMO-MAC

Mari Kobayashi, Giuseppe Caire

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

We consider the weighted sum rate maximization in Gaussian MIMO multiple access channel (MAC) under individual power constraints. This problem arises in the stability-wise optimal scheduling policy that allocates the resource as a function of the buffer queue states and the channel matrices in each time slot. The straightforward generalization of Yu et al.'s well-known iterative waterfilling algorithm for the sum rate maximization is non-trivial because the problem cannot reduce to decoupled single-user waterfilling-type solutions with arbitrary weights. Therefore, we propose a simple alternative treating multiple antennas at each transmitter as virtual single-antenna transmitters, which enables a iterative waterfilling-type algorithm. For a special case such as a OFDM-MAC, the proposed algorithm converges to the optimal solution faster than a steepest ascent algorithm and makes the convergence speed independent of the number of subcarriers.

Original languageEnglish
Title of host publication2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications, SPAWC
DOIs
StatePublished - 2006
Externally publishedYes
Event2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications, SPAWC - Cannes, France
Duration: 2 Jul 20065 Jul 2006

Publication series

NameIEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC

Conference

Conference2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications, SPAWC
Country/TerritoryFrance
CityCannes
Period2/07/065/07/06

Fingerprint

Dive into the research topics of 'Iterative waterfilling for weighted rate sum maximization in MIMO-MAC'. Together they form a unique fingerprint.

Cite this