Capacity Approximations for a Deterministic MIMO Channel
Abstract
In this paper, we derive closed form approximations for the capacity of a point-to-point, deterministic Gaussian MIMO communication channel. We focus on the behavior of the inverse eigenvalues of the Gram matrix associated with the gain matrix of the MIMO channel, by considering small variance and large power assumptions. We revisit the concept of deterministic MIMO capacity by pointing out that, under transmitter power constraint, the optimal transmit covariance matrix is not necessarily diagonal. We discuss the water filling algorithm for obtaining the optimal eigenvalues of the transmitter covariance matrix, and the water fill level in conjunction with the Karush-Kuhn-Tucker optimality conditions. We revise the Telatar conjecture for the capacity of a non-ergodic channel. We also provide deterministic examples and numerical simulations of the capacity, which are discussed in terms of our mathematical framework.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 2011
- Accession Number
- ADA585371
Entities
People
- Ira S. Moskowitz
- Myong H. Kang
- Paul Cotae
- Pedro N. Safier