Squeezing the Arimoto-Blahut algorithm for faster convergence
Information Theory
2010-06-16 v1 math.IT
Computation
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.
Cite
@article{arxiv.0906.3849,
title = {Squeezing the Arimoto-Blahut algorithm for faster convergence},
author = {Yaming Yu},
journal= {arXiv preprint arXiv:0906.3849},
year = {2010}
}