Sum capacity of Gaussian vector broadcast channels

被引:468
作者
Yu, W [1 ]
Cioffi, JM
机构
[1] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON M5S 3G4, Canada
[2] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA
关键词
broadcast channel; minimax optimization; precoding; writing on dirty paper;
D O I
10.1109/TIT.2004.833336
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper characterizes the sum capacity of a class of potentially nondegraded Gaussian vector broadcast channels where a single transmitter with multiple transmit terminals sends independent information to multiple receivers; Coordination is allowed among the transmit terminals, but not among the receive terminals. The sum capacity is shown to be a saddle-point of a Gaussian mutual information game, where a signal player chooses a transmit covariance matrix to maximize the mutual information and a fictitious noise player chooses a noise correlation to minimize the mutual information. The sum capacity is achieved using a precoding strategy for Gaussian channels with additive side information noncausally known at the transmitter. The optimal precoding structure is shown to correspond to a decision-feedback equalizer that decomposes the broadcast channel into a series of single-user channels with interference pre-subtracted at the transmitter.
引用
收藏
页码:1875 / 1892
页数:18
相关论文
共 36 条