By Topic

An upper bound on the speed of convergence of the Blahut algorithm for computing rate-distortion functions (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

An upper bound on the speed of convergence of Blahut algorithm is derived. This bound is inversely proportional to the number of iterations.

Published in:

Information Theory, IEEE Transactions on  (Volume:19 ,  Issue: 5 )