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

Author

Jindal, N. ; Jafar, S. ; Vishwanath, S. ; Goldsmith, A.

Author_Institution

Dept. of Electr. Eng., Stanford Univ., CA, USA

Volume

2

fYear

2002

fDate

3-6 Nov. 2002

Firstpage

1518

Abstract

We consider the problem of maximizing sum rate on a multiple-antenna downlink in which the base station and receivers have multiple-antennas. The optimum scheme for this system was recently found to be "dirty paper coding". Obtaining the optimal transmission policies of the users when employing this dirty paper coding scheme is a computationally complex nonconvex problem. We use a "duality" to transform this problem into a convex multiple access problem, and then obtain a simple and fast iterative algorithm that gives us the optimum transmission policies.

Keywords

Gaussian channels; broadcast channels; cellular radio; channel coding; iterative methods; optimisation; radio receivers; Gaussian broadcast channels; base station; convex multiple access problem; dirty paper coding; duality; multiple-antenna downlink; optimal transmission policies; receivers; sum power iterative water-filling; sum rate maximization; Algorithm design and analysis; Base stations; Broadcasting; Downlink; Iterative algorithms; MIMO; Power system modeling;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 2002. Conference Record of the Thirty-Sixth Asilomar Conference on

Conference_Location

Pacific Grove, CA, USA

ISSN

1058-6393

Print_ISBN

0-7803-7576-9

Type

conf

DOI

10.1109/ACSSC.2002.1197032

Filename

1197032