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

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

2007-12-03

arxiv.org/abs/0712.0305v1

Computer Science

Information Theory

Submitted to the IEEE Transactions on Communications (Letters)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The analytic computability of the Shannon transform for a large class of random matrix channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The analytic computability of the Shannon transform for a large class of random matrix channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The analytic computability of the Shannon transform for a large class of random matrix channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-51143