Back to Search
Start Over
A Deterministic Algorithm for the Capacity of Finite-State Channels.
- Source :
-
IEEE Transactions on Information Theory . Mar2022, Vol. 68 Issue 3, p1465-1479. 15p. - Publication Year :
- 2022
-
Abstract
- 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, our first algorithm proves to achieve polynomial accuracy in polynomial time and, moreover, for some special families of finite-state channels our algorithm can achieve exponential accuracy in polynomial time under some technical conditions. For the case that the channel mutual information rate may not be strongly concave, our second algorithm proves to be at least locally convergent. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 68
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 155458622
- Full Text :
- https://doi.org/10.1109/TIT.2021.3132675