Sum power iterative waterfilling for Gaussian vector broadcast channels

Sriram Vishwanath; Wonjong Rhee; Nihar Jindal; Syed Jafar; Andrea Goldsmith

Sum power iterative waterfilling for Gaussian vector broadcast channels

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

Stony Brook University

Stony Brook University

Research output: Contribution to journal › Conference article › peer-review

17 Scopus citations

Abstract

We obtain an efficient algorithm for computing the sum capacity of vector broadcast channel. This algorithm utilizes the duality between broadcast and multiple access channels and the Kuhn-Tucker conditions of sum power multiple access channel.

Original language	English
Pages (from-to)	467
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
State	Published - 2003
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003

Cite this

@article{1665581a387d467d9db7e290411c6e85,

title = "Sum power iterative waterfilling for Gaussian vector broadcast channels",

abstract = "We obtain an efficient algorithm for computing the sum capacity of vector broadcast channel. This algorithm utilizes the duality between broadcast and multiple access channels and the Kuhn-Tucker conditions of sum power multiple access channel.",

author = "Sriram Vishwanath and Wonjong Rhee and Nihar Jindal and Syed Jafar and Andrea Goldsmith",

year = "2003",

language = "English",

pages = "467",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8097",

note = "Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) ; Conference date: 29-06-2003 Through 04-07-2003",

}

TY - JOUR

T1 - Sum power iterative waterfilling for Gaussian vector broadcast channels

AU - Vishwanath, Sriram

AU - Rhee, Wonjong

AU - Jindal, Nihar

AU - Jafar, Syed

AU - Goldsmith, Andrea

PY - 2003

Y1 - 2003

N2 - We obtain an efficient algorithm for computing the sum capacity of vector broadcast channel. This algorithm utilizes the duality between broadcast and multiple access channels and the Kuhn-Tucker conditions of sum power multiple access channel.

AB - We obtain an efficient algorithm for computing the sum capacity of vector broadcast channel. This algorithm utilizes the duality between broadcast and multiple access channels and the Kuhn-Tucker conditions of sum power multiple access channel.

UR - https://www.scopus.com/pages/publications/0141904167

M3 - Conference article

SN - 2157-8097

SP - 467

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Y2 - 29 June 2003 through 4 July 2003

ER -

Sum power iterative waterfilling for Gaussian vector broadcast channels

Abstract

Other files and links

Fingerprint

Cite this