On slow-fading non-separable correlation MIMO systems
Reza Rashidi Far, Tamer Oraby, Wlodzimierz Bryc, Roland Speicher

TL;DR
This paper develops a method using operator-valued free probability to compute the asymptotic eigenvalue distribution of large block matrices in slow-fading MIMO channels with correlated Gaussian entries, aiding performance analysis.
Contribution
It introduces a novel approach to determine the eigenvalue distribution of block matrices in slow-fading MIMO systems with non-separable correlation, extending free probability techniques.
Findings
Derived a system of equations for eigenvalue distribution
Provided a numerical method for computation
Applied to correlated Gaussian MIMO channels
Abstract
In a frequency selective slow-fading channel in a MIMO system, the channel matrix is of the form of a block matrix. We propose a method to calculate the limit of the eigenvalue distribution of block matrices if the size of the blocks tends to infinity. We will also calculate the asymptotic eigenvalue distribution of , where the entries of are jointly Gaussian, with a correlation of the form (where is fixed and does not increase with the size of the matrix). We will use an operator-valued free probability approach to achieve this goal. Using this method, we derive a system of equations, which can be solved numerically to compute the desired eigenvalue distribution.
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.
Taxonomy
TopicsWireless Communication Networks Research · Advanced MIMO Systems Optimization · Random Matrices and Applications
