Computable Upper Bounds for Unifilar Finite-State Channels

Bashar Huleihel; Oron Sabag; Haim H. Permuter; Navin Kashyap; Shlomo Shamai Shitz

doi:10.1109/ISIT.2019.8849776

Computable Upper Bounds for Unifilar Finite-State Channels

Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai Shitz

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

In this paper, we study the capacity of unifilar finite-state channels. We derive upper bounds that are based on the dual capacity bounding technique using test distributions with memory on directed Q-graphs. The bounds hold for any choice of graph-based test distribution and result in a multi-letter expression. The computability of the upper bound is shown via a novel dynamic programming formulation that can be efficiently evaluated. We further show that the bounds can be simplified to simple single-letter expressions by solving the corresponding Bellman equation explicitly. In particular, for the Ising and Trapdoor channels, we provide simple analytic upper bounds which outperform all previous bounds from the literature.

Original language	English
Title of host publication	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1892-1896
Number of pages	5
ISBN (Electronic)	9781538692912
DOIs	https://doi.org/10.1109/ISIT.2019.8849776
State	Published - Jul 2019
Externally published	Yes
Event	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France Duration: 7 Jul 2019 → 12 Jul 2019

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2019-July
ISSN (Print)	2157-8095

Conference

Conference	2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/Territory	France
City	Paris
Period	7/07/19 → 12/07/19

Bibliographical note

Publisher Copyright:
© 2019 IEEE.

Access to Document

10.1109/ISIT.2019.8849776

Cite this

Huleihel, B., Sabag, O., Permuter, H. H., Kashyap, N., & Shamai Shitz, S. (2019). Computable Upper Bounds for Unifilar Finite-State Channels. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings (pp. 1892-1896). Article 8849776 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2019.8849776

@inproceedings{e6b7980cb67b4261a066d7bc70270c15,

title = "Computable Upper Bounds for Unifilar Finite-State Channels",

abstract = "In this paper, we study the capacity of unifilar finite-state channels. We derive upper bounds that are based on the dual capacity bounding technique using test distributions with memory on directed Q-graphs. The bounds hold for any choice of graph-based test distribution and result in a multi-letter expression. The computability of the upper bound is shown via a novel dynamic programming formulation that can be efficiently evaluated. We further show that the bounds can be simplified to simple single-letter expressions by solving the corresponding Bellman equation explicitly. In particular, for the Ising and Trapdoor channels, we provide simple analytic upper bounds which outperform all previous bounds from the literature.",

author = "Bashar Huleihel and Oron Sabag and Permuter, {Haim H.} and Navin Kashyap and {Shamai Shitz}, Shlomo",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Symposium on Information Theory, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

year = "2019",

month = jul,

doi = "10.1109/ISIT.2019.8849776",

language = "אנגלית",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1892--1896",

booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",

address = "ארצות הברית",

}

Huleihel, B, Sabag, O, Permuter, HH, Kashyap, N & Shamai Shitz, S 2019, Computable Upper Bounds for Unifilar Finite-State Channels. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849776, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, Institute of Electrical and Electronics Engineers Inc., pp. 1892-1896, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7/07/19. https://doi.org/10.1109/ISIT.2019.8849776

Computable Upper Bounds for Unifilar Finite-State Channels. / Huleihel, Bashar; Sabag, Oron; Permuter, Haim H. et al.
2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. p. 1892-1896 8849776 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Computable Upper Bounds for Unifilar Finite-State Channels

AU - Huleihel, Bashar

AU - Sabag, Oron

AU - Permuter, Haim H.

AU - Kashyap, Navin

AU - Shamai Shitz, Shlomo

PY - 2019/7

Y1 - 2019/7

N2 - In this paper, we study the capacity of unifilar finite-state channels. We derive upper bounds that are based on the dual capacity bounding technique using test distributions with memory on directed Q-graphs. The bounds hold for any choice of graph-based test distribution and result in a multi-letter expression. The computability of the upper bound is shown via a novel dynamic programming formulation that can be efficiently evaluated. We further show that the bounds can be simplified to simple single-letter expressions by solving the corresponding Bellman equation explicitly. In particular, for the Ising and Trapdoor channels, we provide simple analytic upper bounds which outperform all previous bounds from the literature.

AB - In this paper, we study the capacity of unifilar finite-state channels. We derive upper bounds that are based on the dual capacity bounding technique using test distributions with memory on directed Q-graphs. The bounds hold for any choice of graph-based test distribution and result in a multi-letter expression. The computability of the upper bound is shown via a novel dynamic programming formulation that can be efficiently evaluated. We further show that the bounds can be simplified to simple single-letter expressions by solving the corresponding Bellman equation explicitly. In particular, for the Ising and Trapdoor channels, we provide simple analytic upper bounds which outperform all previous bounds from the literature.

UR - http://www.scopus.com/inward/record.url?scp=85073149422&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2019.8849776

DO - 10.1109/ISIT.2019.8849776

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85073149422

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1892

EP - 1896

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -

Huleihel B, Sabag O, Permuter HH, Kashyap N, Shamai Shitz S. Computable Upper Bounds for Unifilar Finite-State Channels. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. p. 1892-1896. 8849776. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2019.8849776

Computable Upper Bounds for Unifilar Finite-State Channels

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this