Analysis of the Convergence Speed of the Arimoto-Blahut Algorithm by the Second-Order Recurrence Formula
From MaRDI portal
Publication:5032538
DOI10.1109/TIT.2021.3095406zbMath1487.65073arXiv2009.08780OpenAlexW3178874807MaRDI QIDQ5032538
Yoshinori Takei, Kohei Watabe, Shin-ichiro Hara, Kenji Nakagawa
Publication date: 17 February 2022
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.08780
Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20) Channel models (including quantum) in information and communication theory (94A40)
This page was built for publication: Analysis of the Convergence Speed of the Arimoto-Blahut Algorithm by the Second-Order Recurrence Formula