Sciweavers

Share
CORR
2007
Springer

The analytic computability of the Shannon transform for a large class of random matrix channels

9 years 2 months ago
The analytic computability of the Shannon transform for a large class of random matrix channels
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.
N. Raj Rao
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where CORR
Authors N. Raj Rao
Comments (0)
books