Squeezing the Arimoto-Blahut algorithm for faster convergence

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.

References in corpus (1)

• Geometrical interpretation and improvements of the Blahut-Arimoto's algorithm

Cited by in corpus (6)

• Capacity of DNA Data Embedding Under Substitution Mutations
• Bregman divergence based em algorithm and its application to classical and quantum rate distortion theory
• Efficient Approximation of Channel Capacities
• Strict Monotonicity and Convergence Rate of Titterington's Algorithm for Computing D-optimal Designs
• Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems
• Analytical calculation formulas for capacities of classical and classical-quantum channels