1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.IT2022★ 1 cited
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…
cs.IT2020★ 1 cited
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…