A single-letter upper bound on the feedback capacity of unifilar finite-state channels

Oron Sabag, Haim H. Permuter, Henry D. Pfister

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

1 Scopus citations

Abstract

A single-letter upper bound on the feedback capacity of a unifilar finite-state channel is derived. The upper bound is tight for all cases where the feedback capacity is known. Its efficiency is also demonstrated by direct application of the bound on the dicode erasure channel, which results in a new capacity result. The bound is based on a new technique, called the Q-contexts mapping, where the channel outputs are recursively quantized to a finite set, called the contexts set.

Original languageAmerican English
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages310-314
Number of pages5
ISBN (Electronic)9781509018062
DOIs
StatePublished - 10 Aug 2016
Externally publishedYes
Event2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain
Duration: 10 Jul 201615 Jul 2016

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2016-August
ISSN (Print)2157-8095

Conference

Conference2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/TerritorySpain
CityBarcelona
Period10/07/1615/07/16

Bibliographical note

Publisher Copyright:
© 2016 IEEE.

Keywords

  • Feedback capacity
  • dicode erasure channel
  • finite state channels

Fingerprint

Dive into the research topics of 'A single-letter upper bound on the feedback capacity of unifilar finite-state channels'. Together they form a unique fingerprint.

Cite this