1 citations · 2 across the 4 of their papers we have counts for
4 papers
On a Proof of the Convergence Speed of a Second-order Recurrence Formula in the Arimoto-Blahut Algorithm
Kenji Nakagawa, Yoshinori Takei, Shin-ichiro Hara
In [8] (Nakagawa, et.al., IEEE Trans. IT, 2021), we investigated the convergence speed of the Arimoto-Blahut algorithm. In [8], the convergence of the order was analyzed b…
Analysis of the Convergence Speed of the Arimoto-Blahut Algorithm by the Second Order Recurrence Formula
Kenji Nakagawa, Yoshinori Takei, Shin-ichiro Hara +1
In this paper, we investigate the convergence speed of the Arimoto-Blahut algorithm. For many channel matrices the convergence is exponential, but for some channel matrices it is s…
Analysis for the Slow Convergence in Arimoto Algorithm
Kenji Nakagawa, Yoshinori Takei, Kohei Watabe
In this paper, we investigate the convergence speed of the Arimoto algorithm. By analyzing the Taylor expansion of the defining function of the Arimoto algorithm, we will clarify t…
On the Hardness of Deriving the Arithmetic Mean Component Competitive Ratio
Toshiya Itoh, Yoshinori Takei
For the multi-objective time series search problem, Hasegawa and Itoh [Theoretical Computer Science, Vo.718, pp.58-66, 2018] presented the best possible online algorithm balanced p…