Sum capacity of Gaussian vector broadcast channels

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.

[1]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[2]  Shlomo Shamai,et al.  Capacity bounds for Gaussian vector broadcast channels , 2003, Multiantenna Channels: Capacity, Coding and Signal Processing.

[3]  Thomas Kailath,et al.  3. State-Space Models in Krein Space , 1999 .

[4]  Thomas M. Cover,et al.  Comments on Broadcast Channels , 1998, IEEE Trans. Inf. Theory.

[5]  David Tse,et al.  Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality , 2003, IEEE Trans. Inf. Theory.

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

[7]  Wei Yu,et al.  Trellis precoding for the broadcast channel , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[8]  John M. Cioffi,et al.  Vectored transmission for digital subscriber line systems , 2002, IEEE J. Sel. Areas Commun..

[9]  David Tse,et al.  DIMACS Series in Discrete Mathematics and Theoretical Computer Science On the Capacity of the Multiple Antenna Broadcast Channel , 2002 .

[10]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[11]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[12]  David Tse,et al.  Sum capacity of the multiple antenna Gaussian broadcast channel , 2002, Proceedings IEEE International Symposium on Information Theory,.

[13]  Andrea J. Goldsmith,et al.  On the capacity of multiple input multiple output broadcast channels , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[14]  K Fan,et al.  Minimax Theorems. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

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

[16]  Patrick P. Bergmans,et al.  A simple converse for broadcast channels with additive white Gaussian noise (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[17]  T. Cover,et al.  Writing on colored paper , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[18]  Andrea J. Goldsmith,et al.  The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise , 2001, IEEE Trans. Inf. Theory.

[19]  A. Sridharan.  Broadcast Channels , 2022 .

[20]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[21]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[22]  Abbas El Gamal,et al.  On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.

[23]  G. Forney,et al.  Generalized Decision-Feedback Equalization for Packet Transmission with ISI and Gaussian Noise , 1997 .

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

[25]  Berç Rustem,et al.  An Interior Point Algorithm for Computing Saddle Points of Constrained Continuous Minimax , 2000, Ann. Oper. Res..

[26]  T. Guess,et al.  Optimum decision feedback multiuser equalization with successive decoding achieves the total capacity of the Gaussian multiple-access channel , 1997, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136).

[27]  Wei Yu.  The Structure of Least-Favorable Noise in Gaussian Vector Broadcast Channels , 2003, Advances in Network Information Theory.

[28]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[29]  Jacob Wolfowitz.  Degraded Broadcast Channels , 1978 .

[30]  R. Tyrrell Rockafellar.  Saddle-points and convex analysis , 1971 .

[31]  Edward C. van der Meulen,et al.  A proof of Marton's coding theorem for the discrete memoryless broadcast channel , 1981, IEEE Trans. Inf. Theory.

[32]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[33]  Hiroshi Sato,et al.  An outer bound to the capacity region of broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[34]  Amos Lapidoth,et al.  The Gaussian watermarking game , 2000, IEEE Trans. Inf. Theory.

[35]  Shunsuke Ihara,et al.  On the Capacity of Channels with Additive Non-Gaussian Noise , 1978, Inf. Control..

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

[37]  John M. Cioffi,et al.  Vector coding for partial response channels , 1990, IEEE Trans. Inf. Theory.

[38]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[39]  John M. Cioffi,et al.  MMSE decision-feedback equalizers and coding. I. Equalization results , 1995, IEEE Trans. Commun..