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 条

[21] Embedded population systems in Markov set-chains
Hartfiel, D. J.
LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 418 (2-3) : 489 - 497
[22] Efficient state classification of finite-state Markov chains
Xie, AG
Beerel, PA
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1998, 17 (12) : 1334 - 1339
[23] PROBABILISTIC FUNCTIONS OF FINITE-STATE MARKOV CHAINS
PETRIE, T
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1967, 57 (03) : 580 - &
[24] Single-Letter Bounds on the Feedback Capacity of Unifilar Finite-State Channels
Sabag, Oron
Permuter, Haim H.
Pfister, Henry D.
2016 IEEE INTERNATIONAL CONFERENCE ON THE SCIENCE OF ELECTRICAL ENGINEERING (ICSEE), 2016,
[25] Solving controlled Markov set-chains with discounting via multipolicy improvement
Chang, Hyeong Soo
Chong, Edwin K. P.
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2007, 52 (03) : 564 - 569
[26] Finite-state Markov modeling of fading channels
Sadeghi, Parastoo
Kennedy, Rodney A.
Rapajic, Predrag B.
Shams, Ramtin
IEEE SIGNAL PROCESSING MAGAZINE, 2008, 25 (05) : 57 - 80
[27] Markov processes asymptotically achieve the capacity of finite-state intersymbol interference channels
Chen, JX
Siegel, PH
2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 349 - 349
[28] Markov processes asymptotically achieve the capacity of finite-state intersymbol interference channels
Chen, Jiangxin
Siegel, Paul H.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (03) : 1295 - 1303
[29] Capacity analysis for finite-state Markov mapping of flat-fading channels
Sadeghi, P
Rapajic, P
IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (05) : 833 - 840
[30] The queued-code in finite-state Markov fading channels with large delay bounds
Goel, Satashu
Negi, Rohit
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 30 - +

← 1 2 3 4 5 →