A generalized Blahut-Arimoto algorithm
A generalized Blahut-Arimoto algorithm
复制标题
广义的 Blahut-Arimoto 算法
DOI：
10.1109/isit.2003.1228067
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
P. Vontobel
中科院分区：
文献类型：
--
作者：
P. Vontobel
Kavcic 在（A. Kavcic，2001）中提出了一种算法，该算法显然可以在不可分解的有限状态通道的输入处找到马尔可夫源的互信息率最大化参数。在本文中，我们证明该算法的驻点确实与信息率曲线的临界点一一对应。 Kavcic 的算法可以被视为广义的 Blahut-Arimoto 算法，因为它包括离散无记忆通道 (DMC) 的经典 Blahut-Arimoto 算法的特殊情况以及寻找无噪声有限状态通道的容量实现输入分布的解决方案（C.E. Shannon，1948）。
Kavcic proposed in (A. Kavcic, 2001) an algorithm that apparently finds the mutual-information-rate-maximizing parameters of a Markov source at the input to an indecomposable finite-state channel. In this paper we prove that the stationary points of this algorithm indeed correspond one-to-one to the critical points of the information-rate curve. Kavcic's algorithm can be considered as a generalized Blahut-Arimoto algorithm, as it includes as special cases the classical Blahut-Arimoto algorithm for discrete memoryless channels (DMCs) and the solution to finding the capacity-achieving input distribution for finite-state channels with no noise (C.E. Shannon, 1948).