DocumentCode
1437685
Title
On the Capacity Achieving Covariance Matrix for Rician MIMO Channels: An Asymptotic Approach
Author
Dumont, Julien ; Hachem, Walid ; Lasaulce, Samson ; Loubaton, Philippe ; Najim, Jamal
Author_Institution
France Telecom, Univ. Paris-Est, France
Volume
56
Issue
3
fYear
2010
fDate
3/1/2010 12:00:00 AM
Firstpage
1048
Lastpage
1069
Abstract
In this paper, the capacity-achieving input covariance matrices for coherent block-fading correlated multiple input multiple output (MIMO) Rician channels are determined. In contrast with the Rayleigh and uncorrelated Rician cases, no closed-form expressions for the eigenvectors of the optimum input covariance matrix are available. Classically, both the eigenvectors and eigenvalues are computed numerically and the corresponding optimization algorithms remain computationally very demanding. In the asymptotic regime where the number of transmit and receive antennas converge to infinity at the same rate, new results related to the accuracy of the approximation of the average mutual information are provided. Based on the accuracy of this approximation, an attractive optimization algorithm is proposed and analyzed. This algorithm is shown to yield an effective way to compute the capacity achieving matrix for the average mutual information and numerical simulation results show that, even for a moderate number of transmit and receive antennas, the new approach provides the same results as direct maximization approaches of the average mutual information.
Keywords
MIMO communication; Rayleigh channels; Rician channels; Rayleigh channels; Rician MIMO Channels; Rician channels; asymptotic approach; capacity achieving covariance matrix; coherent block-fading; input covariance; Algorithm design and analysis; Approximation algorithms; Closed-form solution; Covariance matrix; Eigenvalues and eigenfunctions; H infinity control; MIMO; Mutual information; Receiving antennas; Rician channels; Multiple input multiple output (MIMO) Rician channels; capacity achieving covariance matrices; ergodic capacity; iterative waterfilling; large random matrices;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2009.2039063
Filename
5429113
Link To Document