By Topic

Error exponents in 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., Univ. of California, Santa Barbara, CA, USA ; K. Rose

The characterization of the set of achievable rate and distortion values for scalable source coding is extended to additionally account for error exponents, namely, the negative normalized asymptotic log likelihood of error events at different layers. The "error" at each layer is defined as the event that the source block is not reproduced within the prespecified fidelity at the corresponding decoder. We consider separate error events at each layer so as to allow a tradeoff analysis for the error exponents when the rate and distortion values are fixed. For two-step coding of discrete memoryless sources, we derive a single-letter characterization of the region of all achievable 6-tuples (R1, R2, E1, E2, D1, D2), i.e., the rate, error exponent, and distortion levels at each layer. We also analyze the special case of successive refinability, where (R1, E1, D1) and (R2, E2, D2) individually achieve the nonscalable bounds. A surprising outcome of the analysis is that for any D1, D2, and E1, there exists a finite threshold Eˆ2≥E1 such that successive refinability is ensured for all E2≥Eˆ2.

Published in:

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