Sum power iterative waterfilling for Gaussian vector broadcast channels

1 January 2003

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 467
https://doi.org/10.1109/isit.2003.1228484

Abstract

An efficient algorithm for computing the sum capacity of vector broadcast channel is obtained in this paper. This algorithm utilizes the duality between broadcast and multiple access channels and the Kuhn-Tucker conditions of sum power multiple access channel.

Keywords

BROADCASTING
ITERATIVE ALGORITHMS
TRANSMITTERS
COVARIANCE MATRIX
CONVERGENCE
EQUATIONS
POWER ENGINEERING COMPUTING
ADDITIVE NOISE
GAUSSIAN NOISE
THROUGHPUT

This publication has 1 reference indexed in Scilit:

On achievable rates in a multi-antenna Gaussian broadcast channel
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002