2000 character limit reached
Squeezing the Arimoto-Blahut algorithm for faster convergence
Published 21 Jun 2009 in cs.IT, math.IT, and stat.CO | (0906.3849v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
