By Topic

Ordering Finite-State Markov Channels by Mutual Information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Andrew W. Eckford ; Dept. of Comput. Sci. & Eng., York Univ., Toronto, ON

In this paper, an ordering result is given for Markov channels with respect to mutual information, under the assumption of an independent and identically distributed (i.i.d.) input distribution. For those Markov channels in which the capacity-achieving input distribution is i.i.d., 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.

Published in:

IEEE Transactions on Information Theory  (Volume:55 ,  Issue: 7 )