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 条
  • [41] The effect of memory order on the capacity of finite-state Markov and flat-fading channels
    Sadeghi, P
    Rapajic, PB
    Krusevac, ZB
    2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 525 - 529
  • [42] Feedback capacity of finite-state machine channels
    Yang, SH
    Kavcic, A
    Tatikonda, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) : 799 - 810
  • [43] Ordering finite-state Markov channels by mutual information
    Eckford, Andrew W.
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 911 - 915
  • [44] On solving controlled Markov set-chains via multi-policy improvement
    Chang, Hyeong Soo
    Chong, Edwin K. P.
    2005 44th IEEE Conference on Decision and Control & European Control Conference, Vols 1-8, 2005, : 8058 - 8063
  • [45] Capacity of Finite-State Channels With Delayed Feedback
    Huleihel, Bashar
    Sabag, Oron
    Permuter, Haim H.
    Kostina, Victoria
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (01) : 16 - 29
  • [46] A Deterministic Algorithm for the Capacity of Finite-State Channels
    Wu, Chengyu
    Han, Guangyue
    Anantharam, Venkat
    Marcus, Brian
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (03) : 1465 - 1479
  • [47] Ordering Finite-State Markov Channels by Mutual Information
    Eckford, Andrew W.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) : 3081 - 3086
  • [48] Finite-state Markov model for Rayleigh fading channels
    Zhang, QQ
    Kassam, SA
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (11) : 1688 - 1692
  • [49] Controlled Markov set-chains under average criteria
    Hosaka, M
    Horiguchi, M
    Kurano, M
    APPLIED MATHEMATICS AND COMPUTATION, 2001, 120 (1-3) : 195 - 209
  • [50] Markov set-chains as abstractions of stochastic hybrid systems
    Abate, Alessandro
    D'Innocenzo, Alessandro
    Di Benedetto, Maria D.
    Sastry, Shankar S.
    HYBRID SYSTEMS: COMPUTATION AND CONTROL, 2008, 4981 : 1 - +
12345