A Deterministic Algorithm for the Capacity of Finite-State Channels

We propose two modified versions of the classical gradient ascent method to compute the capacity of finite-state channels with Markovian inputs. For the case that the channel mutual information rate is strongly concave in a parameter taking values in a compact convex subset of some Euclidean space,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory Jg. 68; H. 3; S. 1465 - 1479
Hauptverfasser:	Wu, Chengyu, Han, Guangyue, Anantharam, Venkat, Marcus, Brian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.03.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Approximation algorithms Channel capacity Channels Convergence Euclidean geometry Euclidean space finite-state channels gradient ascent hidden Markov processes Markov processes Monte Carlo methods Mutual information Polynomials Power capacitors
ISSN:	0018-9448, 1557-9654
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!