Ordering Finite-State Markov Channels by Mutual Information

DOI10.1109/TIT.2009.2021369MaRDI QIDQ4975915zbMATH OpenOpenAlexFDO

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0705.1159

Signal detection and filtering (aspects of stochastic processes) (60G35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40)

Abstract: 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.

Cited in

(1)

Capacity, mutual information, and coding for finite-state Markov channels

This page was built for publication: Ordering Finite-State Markov Channels by Mutual Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975915)