Squeezing the Arimoto–Blahut Algorithm for Faster Convergence
Yaming Yu · IEEE Transactions on Information Theory · 2010
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.