By Topic

Hierarchical guessing with a fidelity criterion

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

3 Author(s)
N. Merhav ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel ; R. M. Roth ; E. Arikan

Arikan and Merhav (1998) studied the problem of guessing a random vector X within distortion D, and characterized the best attainable exponent E(D,ρ) of the ρth moment of the number of required guesses G(X) until the guessing error falls below D. We extend these results to a multistage, hierarchical guessing model, which allows for a faster search for a codeword vector at the encoder of a rate-distortion codebook. In the two-stage case of this model, if the target distortion level is D2, the guesser first makes guesses with respect to (a higher) distortion level D1, and then, upon his/her first success, directs the subsequent guesses to distortion D2. As in the above-mentioned earlier paper, we provide a single-letter characterization of the best attainable guessing exponent, which relies heavily on well-known results on the successive refinement problem. We also relate this guessing exponent function to the source-coding error exponent function of the two-step coding process

Published in:

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