DocumentCode
920061
Title
An upper bound on the speed of convergence of the Blahut algorithm for computing rate-distortion functions (Corresp.)
Author
Boukris, P.
Volume
19
Issue
5
fYear
1973
fDate
9/1/1973 12:00:00 AM
Firstpage
708
Lastpage
709
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1973.1055067
Filename
1055067
Link To Document