Tighter bounds on the capacity of finite-state channels via markov set-chains

Jun Chen; Haim Permuter; Tsachy Weissman

doi:10.1109/TIT.2010.2050825

Tighter bounds on the capacity of finite-state channels via markov set-chains

Jun Chen, Haim Permuter, Tsachy Weissman

Department of Electrical & Computer Engineering

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new bounds coincide and yield single-letter capacity characterizations for a class of channels with the state process known at the receiver, including channels whose long-term marginal state distribution is independent of the input process. Analogous results are established for finite-state multiple access channels.

Original language	English
Article number	5508606
Pages (from-to)	3660-3691
Number of pages	32
Journal	IEEE Transactions on Information Theory
Volume	56
Issue number	8
DOIs	https://doi.org/10.1109/TIT.2010.2050825
State	Published - 1 Aug 2010

Keywords

Channel capacity
Markov set-chains
finite-state channel
multiple access channels

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/TIT.2010.2050825

Cite this

@article{1dc719bdcae54946941508aadbdddfae,

title = "Tighter bounds on the capacity of finite-state channels via markov set-chains",

abstract = "The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new bounds coincide and yield single-letter capacity characterizations for a class of channels with the state process known at the receiver, including channels whose long-term marginal state distribution is independent of the input process. Analogous results are established for finite-state multiple access channels.",

keywords = "Channel capacity, Markov set-chains, finite-state channel, multiple access channels",

author = "Jun Chen and Haim Permuter and Tsachy Weissman",

note = "Funding Information: Dr. Permuter is a recipient of the Fullbright Fellowship, the Stanford Graduate Fellowship (SGF), Allon Fellowship, and Bergman award.",

year = "2010",

month = aug,

day = "1",

doi = "10.1109/TIT.2010.2050825",

language = "English",

volume = "56",

pages = "3660--3691",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "8",

}

TY - JOUR

T1 - Tighter bounds on the capacity of finite-state channels via markov set-chains

AU - Chen, Jun

AU - Permuter, Haim

AU - Weissman, Tsachy

N1 - Funding Information: Dr. Permuter is a recipient of the Fullbright Fellowship, the Stanford Graduate Fellowship (SGF), Allon Fellowship, and Bergman award.

PY - 2010/8/1

Y1 - 2010/8/1

N2 - The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new bounds coincide and yield single-letter capacity characterizations for a class of channels with the state process known at the receiver, including channels whose long-term marginal state distribution is independent of the input process. Analogous results are established for finite-state multiple access channels.

AB - The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new bounds coincide and yield single-letter capacity characterizations for a class of channels with the state process known at the receiver, including channels whose long-term marginal state distribution is independent of the input process. Analogous results are established for finite-state multiple access channels.

KW - Channel capacity

KW - Markov set-chains

KW - finite-state channel

KW - multiple access channels

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

U2 - 10.1109/TIT.2010.2050825

DO - 10.1109/TIT.2010.2050825

M3 - Article

AN - SCOPUS:77954589662

SN - 0018-9448

VL - 56

SP - 3660

EP - 3691

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 8

M1 - 5508606

ER -

Tighter bounds on the capacity of finite-state channels via markov set-chains

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this