Optimizing information rate bounds for channels with memory

Parastoo Sadeghi*, Pascal O. Vontobel, Ramtin Shams

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    4 Citations (Scopus)

    Abstract

    We consider the problem of optimizing information rate upper and lower bounds for communication channels with (possibly large) memory. A recently proposed auxiliary-channel-based technique allows one to efficiently compute upper and lower bounds on the information rate of such channels. Towards tightening these bounds, we propose iterative expectation-maximization (EM) type algorithms to optimize the parameters of the auxiliary finite-state machine channel (FSMC). From a channel coding perspective, optimizing the lower bound is related to increasing the achievable mismatched information rate, i.e. the information rate of a communication system where the maximum-likelihood decoder at the receiver is matched to the auxiliary channel and not to the true channel. We provide explicit solutions for optimizing the upper bound and the difference between the upper and the lower bound and we discuss a method for the optimization of the lower bound for data-controllable channels with memory. We discuss examples of channels with memory, for which application of the developed theory results in noticeably tighter information rate bounds.

    Original languageEnglish
    Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
    Pages171-175
    Number of pages5
    DOIs
    Publication statusPublished - 2007
    Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
    Duration: 24 Jun 200729 Jun 2007

    Publication series

    NameIEEE International Symposium on Information Theory - Proceedings
    ISSN (Print)2157-8101

    Conference

    Conference2007 IEEE International Symposium on Information Theory, ISIT 2007
    Country/TerritoryFrance
    CityNice
    Period24/06/0729/06/07

    Fingerprint

    Dive into the research topics of 'Optimizing information rate bounds for channels with memory'. Together they form a unique fingerprint.

    Cite this