The Structure of Least-Favorable Noise in Gaussian Vector Broadcast Channels

The sum capacity of the Gaussian vector broadcast channel is the saddle point of a Gaussian mutual information game in which the transmitter maximizes the mutual information by choosing the best transmit covariance matrix subject to a power constraint, and the receiver minimizes the mutual information by choosing a least-favorable noise covariance matrix subject to a diagonal constraint. This result has been established using a decision-feedback equalization approach under the assumption that the least-favorable noise covariance matrix is non-singular. This paper generalizes the above result to the case where the least-favorable noise is singular. In particular, it is shown that the least-favorable noise is not unique, and different least-favorable noise covariance matrices are related to each other by a linear estimation relation.

[1]  Wei Yu,et al.  A Dual Decomposition Approach to the Sum Power Gaussian Vector Multiple Access Channel Sum Capacity Problem , 2003 .

[2]  Wei Yu,et al.  Sum capacity of Gaussian vector broadcast channels , 2004, IEEE Transactions on Information Theory.

[3]  Andrea J. Goldsmith,et al.  Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels , 2003, IEEE Trans. Inf. Theory.

[4]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[5]  Suhas N. Diggavi,et al.  The worst additive noise under a covariance constraint , 2001, IEEE Trans. Inf. Theory.

[6]  Nihar Jindal,et al.  Sum power iterative waterfilling for Gaussian vector broadcast channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[7]  Shlomo Shamai,et al.  On the achievable throughput of a multiantenna Gaussian broadcast channel , 2003, IEEE Transactions on Information Theory.