Correlated Jamming on MIMO Gaussian Fading Channels

We consider a zero-sum mutual information game on multiple-input multiple-output (MIMO) Gaussian Rayleigh-fading channels. The players are an encoder-decoder pair as the maximizer, and a jammer as the minimizer, of the mutual information between the input and the output of the channel. There are total power constraints on both the jammer and the encoder. Also, the jammer has access to the encoder output. We find the unique saddle point of this game, and prove the somewhat surprising result that the knowledge of the channel input is useless to the jammer.

[1]  R. McEliece,et al.  Some Information Theoretic Saddlepoints , 1985 .

[2]  Tamer Basar,et al.  With the Capacity 0.461(bits) and the Optimal Opd Being 'q = , 1998 .

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

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

[5]  Wayne E. Stark,et al.  On the capacity of channels with block memory , 1988, IEEE Trans. Inf. Theory.

[6]  A. Lapidoth,et al.  On the log determinant of noncentral Wishart matrices , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[7]  R. Srikant,et al.  Correlated jamming on MIMO Gaussian fading channels , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[8]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[9]  T. W. Anderson.  The integral of a symmetric unimodal function over a symmetric convex set and some probability inequalities , 1955 .