2022/09/11 by Kenji Nakagawa, Nakagawa, Kenji, Yoshinori Takei +3
Engineering · #Advanced Wireless Communication Techniques #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Numerical Analysis (math.NA) #Optical Network Technologies #PAPR reduction in OFDM
paper · pdf · doi:10.48550/arxiv.2209.04961
openalex publication_date 2022/09/11 · openalex created_date 2022/09/14 · openalex updated_date 2026/07/28
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 O(1/N) was analyzed by focusing on the second-order nonlinear recurrence formula consisting of the first- and second-order terms of the Taylor expansion of the defining function of the Arimoto-Blahut algorithm. However, in [8], an infinite number of inequalities were assumed as a "conjecture," and proofs were given based on the conjecture. In this paper, we report a proof of the convergence of the order O(1/N) for a class of channel matrices without assuming the conjecture. The correctness of the proof will be confirmed by several numerical examples.