Complex random matrices and Rician channel capacity

  • Authors:
  • T. Ratnarajah;R. Vaillancourt;M. Alvo

  • Affiliations:
  • Department of Mathematics and Statistics, University of Ottawa, Canada;Department of Mathematics and Statistics, University of Ottawa, Canada;Department of Mathematics and Statistics, University of Ottawa, Canada

  • Venue:
  • Problems of Information Transmission
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Eigenvalue densities of complex noncentral Wishart matrices are investigated to study an open problem in information theory. Specifically, the largest, smallest, and joint eigenvalue densities of complex noncentral Wishart matrices are derived. These densities are expressed in terms of complex zonal polynomials and invariant polynomials. A connection between the complex Wishart matrix theory and information theory is given. This facilitates evaluation of the most important information-theoretic measure, the so-called ergodic channel capacity. In particular, the capacity of multiple-input multiple-output (MIMO) Rician distributed channels is investigated. We consider both spatially correlated and uncorrelated MIMO Rician channels and derive exact and easily computable tight upper bound formulas for ergodic capacities. Numerical results are also given, which show how the channel correlation degrades the capacity of the communication system.