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.

• Type: Journal
• Year: 2007
• Where: CORR
• Authors: N. Raj Rao
• Keywords: Coefficient Enumeration Techniques, CORR 2007, Education, Random Matrix Channels, SNR Series Expansion