We find a new formula for matrix averages over the Gaussian ensemble. Let be an Gaussian random matrix with complex, independent, and identically distributed entries of zero mean and unit variance. Given an positive definite matrix and a continuous function such that for every , we find a new formula for the expectation . Taking gives another formula for the capacity of the MIMO communication channel, and taking gives the MMSE achieved by a linear receiver. 1. Introduction Random matrix theory was introduced to the theoretical physics community by Wigner in his work on nuclear physics in the 1950s [1, 2]. Since that time, the subject is an important and active research area in mathematics, and it finds applications in fields as diverse as the Riemann conjecture, physics, chaotic systems, multivariate statistics, wireless communications, signal processing, compressed sensing, and information theory. In the last decades, a considerable amount of work has emerged in the communications and information theory on the fundamental limits of communication channels that make use of results in random matrix theory [3–5]. For this reason, computing averages over certain matrix ensembles becomes extremely important in many situations. To be more specific, consider the well-known case of the single user MIMO channel with multiple transmitting and receiving antennas. Denoting the number of transmitting antennas by and the number of receiving antennas by , the channel model is where is the transmitted vector, is the received vector, is a complex matrix, and is the zero mean complex Gaussian vector with independent, equal variance entries. We assume that , where denotes the complex conjugate transpose. It is reasonable to put a power constraint where is the total transmitted power. The signal to noise ratio, denoted by snr, is defined as the quotient of the signal power and the noise power and in this case is equal to . Recall that if is an Hermitian matrix, then there exists unitary and such that . Given a continuous function , we define as Naturally, the simplest example is the one where has independent and identically distributed (i.i.d.) Gaussian entries, which constitutes the canonical model for the single user narrow band MIMO channel. It is known that the capacity of this channel is achieved when is a complex Gaussian zero mean and covariance snr vector (see e.g., [4, 6]). For the fast fading channel, assuming the statistical channel state information at the transmitter, the ergodic capacity is given by where in the last equality we use the fact that . We refer
References
[1]
E. P. Wigner, “Characteristic vectors of bordered matrices with infinite dimensions,” Annals of Mathematics, vol. 62, pp. 548–564, 1955.
[2]
E. P. Wigner, “On the distribution of the roots of certain symmetric matrices,” Annals of Mathematics, vol. 67, pp. 325–327, 1958.
[3]
M. L. Mehta, Random Matrices, vol. 142, Academic Press, 3rd edition, 2004.
[4]
S. Verdu and A. M. Tulino, Random Matrix Theory and Wireless Communications, Now Publishers, 2004.
[5]
G. W. Anderson, A. Guionnet, and O. Zeitouni, An Introduction to Random Matrices, vol. 118, Cambridge University Press, Cambridge, UK, 2010.
[6]
E. Telatar, “Capacity of multi-antenna Gaussian channels,” European Transactions on Telecommunications, vol. 10, no. 6, pp. 585–595, 1999.
[7]
S. H. Simon, A. L. Moustakas, and L. Marinelli, “Capacity and character expansions: moment-generating function and other exact results for MIMO correlated channels,” IEEE Transactions on Information Theory, vol. 52, no. 12, pp. 5336–5351, 2006.
[8]
T. Ratnarajah, R. Vaillancourt, and M. Alvo, “Complex random matrices and Rayleigh channel capacity,” Communications in Information and Systems, vol. 3, no. 2, pp. 119–138, 2003.
[9]
T. L. Marzetta and B. M. Hochwald, “Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading,” IEEE Transactions on Information Theory, vol. 45, no. 1, pp. 139–157, 1999.
[10]
B. D. McKay, “The expected eigenvalue distribution of a large regular graph,” Linear Algebra and its Applications, vol. 40, pp. 203–216, 1981.
[11]
J. W. Silverstein and Z. D. Bai, “On the empirical distribution of eigenvalues of a class of large-dimensional random matrices,” Journal of Multivariate Analysis, vol. 54, no. 2, pp. 175–192, 1995.
[12]
M. Debbah, W. Hachem, P. Loubaton, and M. de Courville, “MMSE analysis of certain large isometric random precoded systems,” IEEE Transactions on Information Theory, vol. 49, no. 5, pp. 1293–1311, 2003.
[13]
V. Marchenko and L. Pastur, “Distribution of eigenvalues for some sets of random matrices,” Mathematics of the USSR-Sbornik, vol. 1, pp. 457–483, 1967.
[14]
A. Edelman, Eigenvalues and condition numbers of random matrices [Ph.D. thesis], Department Mathematics, MIT, 1989.
[15]
J. W. Silverstein and S.-I. Choi, “Analysis of the limiting spectral distribution of large-dimensional random matrices,” Journal of Multivariate Analysis, vol. 54, no. 2, pp. 295–309, 1995.
[16]
W. Fulton and J. Harris, Representation Theory, vol. 129, Springer, New York, NY, USA, 1991.
[17]
R. J. Muirhead, Aspects of Multivariate Statistical Theory, John Wiley & Sons Inc., New York, NY, USA, 1982.
[18]
I. G. Macdonald, Symmetric Functions and Hall Polynomials, The Clarendon Press Oxford University Press, New York, NY, USA, 2nd edition, 1995.
[19]
B. E. Sagan, The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions, vol. 203, Springer, New York, NY, USA, 2nd edition, 2001.
[20]
B. Spain and M. Smith, Functions of Mathematical Physics, Von Nostrand Reinhold Company, 1970.