Sum power iterative waterfilling for Gaussian vector broadcast channels

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 467-

  Vishwanath, Sriram ^a   Rhee, Wonjong ^b   Jindal, Nihar ^a   Jafar, Syed ^a   Goldsmith, Andrea ^a  

^a Stanford University   (United States)

^b ArrayComm LLC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVARIANCE MATRICES; GAUSSIAN VECTOR BROADCAST CHANNELS; KUHN-TUCKER CONDITIONS; SUM POWER MULTIPLE ACCESS CHANNEL;

ALGORITHMS; BROADCASTING; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING; VECTORS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0141904167     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. G. Caire and S. Shamai, "On the Achievable Throughput of a Multi-antenna Gaussian Broadcast Channel", Proc. IEEE Intl. Symp. Inform. Theory, ISIT 2001, Washington D.C., June 2001. Also submitted to the IEEE Trans. Inform. Theory.
2. S. Vishwanath, N. Jindal and A. Goldsmith, "Sum Capacity of Multi-Antenna Gaussian Broadcast Channels", Proc. IEEE Intl. Conf. Commun., 2001.
3. W. Yu, W. Rhee, S. Boyd and J. Cioffi, "Iterative Water-filling for Vector Multiple Access Channels", IEEE Intl. Symp. Inform. Theory, (ISIT), 2001