An iterative water-filling algorithm for maximum weighted sum-rate of Gaussian MIMO-BC

Mari Kobayashi, Giuseppe Caire

Research output: Contribution to journalArticlepeer-review

132 Scopus citations


We consider the maximization of weighted rate sum in Gaussian multiple-input-multiple-output broadcast channels. This problem is motivated by optimal adaptive resource allocation policies in wireless systems with multiple antenna at the base station. In fact, under random packet arrival and transmission queues, the system stability region is achieved by maximizing a weighted rate sum with suitable weights that depend on the queue buffer sizes. Our algorithm is a generalization of the well-known Iterative Multiuser Water-Filling that maximizes the rate sum under a total transmit power constraint and inherits from the latter its simplicity. We propose also a variation on the basic algorithm that makes convergence speed very fast and essentially independent of the number of users.

Original languageEnglish
Article number1665016
Pages (from-to)1640-1646
Number of pages7
JournalIEEE Journal on Selected Areas in Communications
Issue number8
StatePublished - Aug 2006
Externally publishedYes


  • Convex optimization
  • Iterative algorithms
  • Stability
  • Uplink-downlink duality
  • Weighted rate sum


Dive into the research topics of 'An iterative water-filling algorithm for maximum weighted sum-rate of Gaussian MIMO-BC'. Together they form a unique fingerprint.

Cite this