Sum power iterative water-filling for multi-antenna Gaussian broadcast channels

Nihar Jindal, Wonjong Rhee, Sriram Vishwanath, Syed Ali Jafar, Andrea Goldsmith

Research output: Contribution to journalArticlepeer-review

513 Scopus citations


In this correspondence, we consider the problem of maximizing sum rate of a multiple-antenna Gaussian broadcast channel (BC). It was recently found that dirty-paper coding is capacity achieving for this channel. In order to achieve capacity, the optimal transmission policy (i,e., the optimal transmit covariance structure) given the channel conditions and power constraint must be found. However, obtaining the optimal transmission policy when employing dirty-paper coding is a computationally complex nonconvex problem. We use duality to transform this problem into a well-structured convex multiple-access channel (MAC) problem. We exploit the structure of this problem and derive simple and fast iterative algorithms that provide the optimum transmission policies for the MAC, which can easily be mapped to the optimal BC policies.

Original languageEnglish (US)
Pages (from-to)1570-1580
Number of pages11
JournalIEEE Transactions on Information Theory
Issue number4
StatePublished - Apr 2005
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


  • Broadcast channel
  • Dirty-paper coding
  • Duality
  • Multiple-access channel (MAC)
  • Multiple-input multiple-output (MIMO)
  • Systems


Dive into the research topics of 'Sum power iterative water-filling for multi-antenna Gaussian broadcast channels'. Together they form a unique fingerprint.

Cite this