Title :
An upper bound on the speed of convergence of the Blahut algorithm for computing rate-distortion functions (Corresp.)
fDate :
9/1/1973 12:00:00 AM
Abstract :
An upper bound on the speed of convergence of Blahut algorithm is derived. This bound is inversely proportional to the number of iterations.
Keywords :
Rate-distortion theory; Convergence; Electrons; Erbium; Information rates; Memoryless systems; Rain; Rate distortion theory; Rate-distortion; Stochastic processes; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1973.1055067
