Tighter Bounds on the Capacity of Finite-State Channels Via Markov Set-Chains

被引：4
|
作者：
Chen, Jun [1 ]
Permuter, Haim [2 ]
Weissman, Tsachy [2 ]
机构：
[1] McMaster Univ, Dept Elect & Comp Engn, Hamilton, ON L8S 4K1, Canada
[2] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2010年 / 57卷 / 08期
基金：
美国国家科学基金会;
关键词：
Channel capacity; finite-state channel; Markov set-chains; multiple access channels; INFORMATION; ERGODICITY;
D O I：
10.1109/TIT.2010.2050825
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：3660 / 3691
页数：32
相关论文
共 50 条
  • [31] About limit matrices of finite-state Markov chains
    Linear Algebra Its Appl, (219-223):
  • [32] THE MARKOV CHAINS (MARKOV SET-CHAINS) AS A TOOL FOR BACTERIAL GENOMES EVOLUTION ANALYSIS
    Sliwka, P.
    Dudkiewicz, M.
    BIOMAT 2008, 2009, : 235 - +
  • [33] About limit matrices of finite-state Markov chains
    Nieuwenhuis, JW
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1997, 250 : 219 - 223
  • [34] A note on the passage time of finite-state Markov chains
    Hong, Wenming
    Zhou, Ke
    COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2017, 46 (01) : 438 - 445
  • [35] STOCHASTIC APPROXIMATIONS FOR FINITE-STATE MARKOV-CHAINS
    MA, DJ
    MAKOWSKI, AM
    SHWARTZ, A
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 1990, 35 (01) : 27 - 45
  • [36] Computable Upper Bounds for Unifilar Finite-State Channels
    Huleihel, Bashar
    Sabag, Oron
    Permuter, Haim H.
    Kashyap, Navin
    Shamai , Shlomo
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1892 - 1896
  • [37] On the Capacity of Indecomposable Finite-State Channels With Feedback
    Dabora, Ron
    Goldsmith, Andrea J.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (01) : 193 - 203
  • [38] A Deterministic Algorithm for the Capacity of Finite-State Channels
    Wu, Chengyu
    Han, Guangyue
    Marcus, Brian
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1897 - 1901
  • [39] A Randomized Algorithm for the Capacity of Finite-State Channels
    Han, Guangyue
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (07) : 3651 - 3669
  • [40] A Randomized Approach to the Capacity of Finite-State Channels
    Han, Guangyue
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2109 - 2113
12345