The analytic computability of the Shannon transform for a large class of random matrix channels
Information Theory
2007-12-04 v1 math.IT
Abstract
We define a class of "algebraic" random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate the low SNR series expansion coefficients in closed form. We describe this class, the coefficient enumeration techniques and compare theory with simulations.
Keywords
Cite
@article{arxiv.0712.0305,
title = {The analytic computability of the Shannon transform for a large class of random matrix channels},
author = {N. Raj Rao},
journal= {arXiv preprint arXiv:0712.0305},
year = {2007}
}
Comments
Submitted to the IEEE Transactions on Communications (Letters)