By Topic

Error exponents for successive refinement by partitioning

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)
A. Kanlis ; Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA ; P. Narayan

Given a discrete memoryless source (DMS) with probability mass function P, we seek first an asymptotically optimal description of the source with distortion not exceeding Δ1, followed by an asymptotically optimal refined description with distortion not exceeding Δ21. The rate-distortion function for successive refinement by partitioning, denoted R(P, Δ1 , Δ2), is the overall optimal rate of these descriptions obtained via a two-step coding process. We determine the error exponents for this two-step coding process, namely, the negative normalized asymptotic log likelihoods of the event that the distortion in either step exceeds its prespecified acceptable value, and of the conditional event that the distortion in the second step exceeds the prespecified value given the rate and distortion of the code for the first step. We show that even when the rate-distortion functions for one- and two-step coding coincide, the error exponent in the former case may exceed those in the latter

Published in:

IEEE Transactions on Information Theory  (Volume:42 ,  Issue: 1 )