Squeezing the Arimoto–Blahut Algorithm for Faster Convergence

DOI10.1109/TIT.2010.2048452MaRDI QIDQ5281382zbMATH OpenFDO

Authors Yaming Yu

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0906.3849

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Abstract: The Arimoto--Blahut algorithm for computing the capacity of a discrete memoryless channel is revisited. A so-called ``squeezing strategy is used to design algorithms that preserve its simplicity and monotonic convergence properties, but have provably better rates of convergence.

Cited in

(4)

• Geometry of Arimoto algorithm
• Computation of channel capacity based on self-concordant functions
• Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
• Reverse EM-problem based on Bregman divergence and its application to classical and quantum information theory

This page was built for publication: Squeezing the Arimoto–Blahut Algorithm for Faster Convergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281382)