Computer Science – Information Theory
Scientific paper
2005-11-15
Computer Science
Information Theory
Submitted to Trans IT
Scientific paper
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.
Collings Iain B.
Honig Michael L.
Peacock Matthew J. M.
No associations
LandOfFree
Eigenvalue Distributions of Sums and Products of Large Random Matrices via Incremental Matrix Expansions 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 Eigenvalue Distributions of Sums and Products of Large Random Matrices via Incremental Matrix Expansions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Eigenvalue Distributions of Sums and Products of Large Random Matrices via Incremental Matrix Expansions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-7456