Ordering Finite-State Markov Channels by Mutual Information

DOI10.1109/TIT.2009.2021369zbMATH Open1367.94244arXiv0705.1159OpenAlexW2023543099MaRDI QIDQ4975915

Author name not available (Why is that?)

Publication date: 8 August 2017

Published in: (Search for Journal in Brave)

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.

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

Mathematics Subject Classification ID

No records found.

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)