Title :
A faster Arimoto-Blahut algorithm via squeezing
Author_Institution :
Dept. of Stat., Univ. of California, Irvine, CA, USA
Abstract :
We present a “squeezing” strategy which aims at improving the convergence rate of the classical Arimoto-Blahut algorithm while preserving its simplicity and monotonic convergence properties.
Keywords :
algorithm theory; convergence; Arimoto-Blahut algorithm; convergence property; convergence rate; squeezing strategy; Dynamic range; Equations; Frequency; Harmonic distortion; Noise level; Signal analysis; Signal to noise ratio; Spectral analysis; Testing; Total harmonic distortion;
Conference_Titel :
Information Theory (ITW 2010, Cairo), 2010 IEEE Information Theory Workshop on
Conference_Location :
Cairo
Print_ISBN :
978-1-4244-6372-5
DOI :
10.1109/ITWKSPS.2010.5503126
