On scalable source coding with decoder side informations

We consider the problem of scalable source coding with decoder side informations. Two special cases of this problem have been investigated in the literature, namely successive refinement Wyner-Ziv (SR-WZ) coding and side-information scalable (SI-Scalable) coding, whose distinction Res in the degradedness of the side informations. In this work, we first show the achievable region for the SI-scalable problem provided in a previous work is tight when either the first stage or the second stage requires lossless reconstruction. Then the notion of perfectly scalable coding is introduced as both the stages operate on the Wyner-Ziv bound, and a set of necessary and sufficient conditions is given for sources satisfying a mild support condition. Furthermore, generalizing the coding scheme for the SR-WZ and SI-scalable coding, we provide a conclusive solution for the (multi-stage) quadratic Gaussian scalable coding problem with jointly Gaussian side informations in an arbitrary order of quality.

Published in:
2007 Ieee International Symposium On Information Theory Proceedings, Vols 1-7, 1461-1465
Presented at:
IEEE International Symposium on Information Theory, Nice, FRANCE, Jun 24-29, 2007
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa

 Record created 2012-07-04, last modified 2018-03-17

Rate this document:

Rate this document:
(Not yet reviewed)