Capacity of multivariate channels with multiplicative noise: I.Random matrix techniques and large-N expansions for full transfer matrices
Anirvan Mayukh Sengupta, Partha Pratim Mitra

TL;DR
This paper derives exact formulas for the capacity of large multivariate Gaussian channels with random full transfer matrices, using random matrix theory and large-N expansions, relevant for multi-antenna wireless systems.
Contribution
It provides novel exact expressions for the distribution and moments of the channel capacity in large random matrix channels with correlated entries, including partially known channel matrices.
Findings
Exact expectation and variance of the capacity in large matrix limit.
Full moment generating function for identity correlation matrices in high SNR.
Capacity formulas for channels with partially known transfer matrices.
Abstract
We study memoryless, discrete time, matrix channels with additive white Gaussian noise and input power constraints of the form , where , and are complex, , , and is a complex matrix with some degree of randomness in its entries. The additive Gaussian noise vector is assumed to have uncorrelated entries. Let be a full matrix (non-sparse) with pairwise correlations between matrix entries of the form , where , are positive definite Hermitian matrices. Simplicities arise in the limit of large matrix sizes (the so called large-N limit) which allow us to obtain several exact expressions relating to the channel capacity. We study the probability distribution of the quantity . is non-negative definite and…
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 Security Techniques · Random Matrices and Applications · Bayesian Methods and Mixture Models
