ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Capacity of a class of modulo-sum relay channels
IEEE Transactions on Information Theory
On scalable distributed coding of correlated sources
IEEE Transactions on Signal Processing
Successive refinement of vector sources under individual distortion criteria
IEEE Transactions on Information Theory
| Hi-index | 754.96 |
Rate-distortion bounds for scalable coding, and conditions under which they coincide with nonscalable bounds, have been extensively studied. These bounds have been derived for the general tree-structured refinement scheme, where reproduction at each layer is an arbitrarily complex function of all encoding indexes up to that layer. However, in most practical applications (e.g., speech coding) "additive" refinement structures such as the multistage vector quantizer are preferred due to memory limitations. We derive an achievable region for the additive successive refinement problem, and show via a converse result that the rate-distortion bound of additive refinement is above that of tree-structured refinement. Necessary and sufficient conditions for the two bounds to coincide are derived. These results easily extend to abstract alphabet sources under the condition E{d(X,a)}