By Topic

Iterative computation of rate-distortion bounds for scalable source coding

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
$33 $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

2 Author(s)
E. Tuncel ; Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA ; K. Rose

We consider N-layer scalable source coding of a finite memoryless source X~px. We propose an iterative algorithm which is a generalization of the Blahut-Arimoto algorithm for rate-distortion computation. The algorithm is initialized with arbitrary nonzero reproduction probabilities, and monotonically approaches the optimal reproduction distribution

Published in:

Information Theory, 2000. Proceedings. IEEE International Symposium on

Date of Conference:

2000