Eigenvalue Distributions of Sums and Products of Large Random Matrices Via Incremental Matrix Expansions

From MaRDI portal
Publication:3604422

DOI10.1109/TIT.2008.920221zbMATH Open1328.94021arXivcs/0511054MaRDI QIDQ3604422FDOQ3604422


Authors: Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig Edit this on Wikidata


Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: This paper uses an incremental matrix expansion approach to derive asymptotic eigenvalue distributions (a.e.d.'s) of sums and products of large random matrices. We show that the result can be derived directly as a consequence of two common assumptions, and matches the results obtained from using R- and S-transforms in free probability theory. We also give a direct derivation of the a.e.d. of the sum of certain random matrices which are not free. This is used to determine the asymptotic signal-to-interference-ratio of a multiuser CDMA system with a minimum mean-square error linear receiver.


Full work available at URL: https://arxiv.org/abs/cs/0511054




Recommendations




Cited In (4)





This page was built for publication: Eigenvalue Distributions of Sums and Products of Large Random Matrices Via Incremental Matrix Expansions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604422)