Iterative waterfilling with user selection in Gaussian MIMO broadcast channels

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

We consider a sum rate maximization problem with user scheduling in Gaussian MIMO broadcast channels, which is a combinatorial optimization problem. We transform it into a cardinality problem taking into account that selecting inactive users is equivalent to allocating zero power to unselected users. Then, we relax the cardinality constraint by introducing a penalty function to promote sparse power allocation among users. The proposed iterative waterfilling with user selection algorithm is a generalization of the well-known iterative waterfilling that maximizes the sum rate under a sum power constraint in MIMO broadcast channels. Numerical results show that it achieves a very high sum rate with a moderate complexity only proportional to the number of users.

Original languageEnglish
Pages (from-to)1902-1911
Number of pages10
JournalIEEE Transactions on Communications
Volume66
Issue number5
DOIs
StatePublished - May 2018

Bibliographical note

Publisher Copyright:
© 1972-2012 IEEE.

Keywords

  • Broadcast channels
  • Iterative waterfilling
  • Power allocation
  • Sparsity
  • User selection

Fingerprint

Dive into the research topics of 'Iterative waterfilling with user selection in Gaussian MIMO broadcast channels'. Together they form a unique fingerprint.

Cite this