Squeezing the Arimoto-Blahut algorithm for faster convergence
classification
💻 cs.IT
math.ITstat.CO
keywords
convergencealgorithmsqueezingalgorithmsarimoto--blahutarimoto-blahutbettercapacity
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.