Capacity Scaling in MIMO Systems with General Unitarily Invariant Random Matrices
Burak \c{C}akmak, Ralf R. M\"uller, Bernard H. Fleury

TL;DR
This paper analyzes how the capacity of MIMO systems scales with the number of antennas, revealing that mutual information loss depends on system dimensions and the distribution of channel matrices, especially under Haar distribution assumptions.
Contribution
It provides a novel analysis of capacity scaling in MIMO systems with unitarily invariant random matrices, including explicit formulas for mutual information loss and asymptotic behavior.
Findings
Mutual information loss depends only on system dimensions and the left-singular vectors matrix.
Ergodic rate loss for Haar-distributed matrices is given by a double sum formula.
Normalized rate loss converges to the binary entropy function as system dimensions grow large.
Abstract
We investigate the capacity scaling of MIMO systems with the system dimensions. To that end, we quantify how the mutual information varies when the number of antennas (at either the receiver or transmitter side) is altered. For a system comprising receive and transmit antennas with , we find the following: By removing as many receive antennas as needed to obtain a square system (provided the channel matrices before and after the removal have full rank) the maximum resulting loss of mutual information over all signal-to-noise ratios (SNRs) depends only on , and the matrix of left-singular vectors of the initial channel matrix, but not on its singular values. In particular, if the latter matrix is Haar distributed the ergodic rate loss is given by nats. Under the same assumption, if with the ratio…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
