On the capacity achieving covariance matrix for Rician MIMO channels: an asymptotic approach

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

56 pp. Extended version of the published article in IEEE Inf. Th. (march 2010) with more proofs

Scientific paper

The capacity-achieving input covariance matrices for coherent block-fading correlated MIMO Rician channels are determined. In this case, no closed-form expressions for the eigenvectors of the optimum input covariance matrix are available. An approximation of the average mutual information is evaluated in this paper in the asymptotic regime where the number of transmit and receive antennas converge to $+\infty$. New results related to the accuracy of the corresponding large system approximation are provided. An attractive optimization algorithm of this approximation is proposed and we establish that it yields an effective way to compute the capacity achieving covariance matrix for the average mutual information. Finally, 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, while being much more computationally attractive.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the capacity achieving covariance matrix for Rician MIMO channels: an asymptotic approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the capacity achieving covariance matrix for Rician MIMO channels: an asymptotic approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the capacity achieving covariance matrix for Rician MIMO channels: an asymptotic approach will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-358207

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.