The redundancy of multi-resolution coding for successively refinable sources

In this paper, we investigate the rate-distortion performance of multi-resolution block coding algorithms for successively refinable sources for block codes. For block codes at fixed rate, although the redundancy from the first stage is accumulated at the second stage, the total computational complexity can be saved and the average distortion can still approach the conditional distortion-rate function asymptotically. The conditional d-ball covering that we developed is an extension of single-stage d-ball covering to the more concrete cases.