The analytic computability of the Shannon transform for a large class of random matrix channels
Abstract
Description
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.
Submitted to the IEEE Transactions on Communications (Letters)
Submitted to the IEEE Transactions on Communications (Letters)