Ordering Finite-State Markov Channels by Mutual Information

Details Ordering Finite-State Markov Channels by Mutual Information Ordering Finite-State Markov Channels by Mutual Information

2007-05-08

arxiv.org/abs/0705.1159v1

Computer Science

Information Theory

5 pages, no figures. To be presented at the 2007 IEEE International Symposium on Information Theory, Nice, France, June 2007

Scientific paper

In previous work, an ordering result was given for the symbolwise probability of error using general Markov channels, under iterative decoding of LDPC codes. In this paper, the ordering result is extended to mutual information, under the assumption of an iid input distribution. For certain channels, in which the capacity-achieving input distribution is iid, this allows ordering of the channels by capacity. The complexity of analyzing general Markov channels is mitigated by this ordering, since it is possible to immediately determine that a wide class of channels, with different numbers of states, has a smaller mutual information than a given channel.

Affiliated with

Also associated with

No associations

Rating

Ordering Finite-State Markov Channels by Mutual Information 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 Ordering Finite-State Markov Channels by Mutual Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ordering Finite-State Markov Channels by Mutual Information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-645148