Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2007
Springer

favoriteEmaildiscussreport

136views Education» more CORR 2007»

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

13 years 4 months ago

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

Download www.mit.edu

We deﬁne 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 coefﬁcients in closed form. We describe this class, the coefﬁcient enumeration techniques and compare theory with simulations.

N. Raj Rao

Real-time Traffic

Coefﬁcient Enumeration Techniques | CORR 2007 | Education | Random Matrix Channels | SNR Series Expansion |

claim paper

Related Content

» Asymptotic Moments for Interference Mitigation in Correlated Fading Channels

» Optimal Multiple Description Transform Coding of Gaussian Vectors

» Phenotype Recognition with Combined Features and Random Subspace Classifier Ensemble

» Reconfigurable decoder architectures for Raptor codes

» The impact of sample reduction on PCAbased feature extraction for supervised learning

» Capacity scaling in delay tolerant networks with heterogeneous mobile nodes

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	N. Raj Rao

Comments (0)