On Successive Refinement for the Kaspi/Heegard-Berger Problem

Consider a source, {Xi, Yi, Zi}i=1 infin, producing independent copies of a triplet of jointly distributed random variables (RVs). The {Xi} part of the process is observed at the encoder, and is supposed to be reproduced at two decoders, decoder 1 and decoder 2 , where the {Yi} and the {Zi} parts of the process are observed, respectively, in either a causal or a non-causal manner. The communication between the encoder and the decoders is carried in two successive communication stages. In the first stage, the transmission is available to both decoders and the decoders reconstruct the source according to the received stream and individual side information ({Zi} or {Yi}). In the second stage, additional information is sent to both decoders and the decoders refine the reconstruction of the source according to the side information available to it and the transmissions in both stages. It is desired to find the necessary and sufficient conditions on communication between the encoder and decoders, so that the distortions incurred (at each stage) will not exceed given thresholds. For such a multi-decoder coding setting with successive refinement and non-causal degraded side information, we derive inner and outer bounds to the achievable rate-distortion region. Then, for the case of general causal side information at the decoders, we derive a single-letter characterization of the achievable region for a multi-decoder source-coding problem with successive refinement.

[1]  Neri Merhav,et al.  On Successive Refinement With Causal Side Information at the Decoders , 2008, IEEE Transactions on Information Theory.

[2]  Suhas N. Diggavi,et al.  On Scalable Source Coding With Decoder Side Informations , 2007, 2007 IEEE International Symposium on Information Theory.

[3]  Claude E. Shannon,et al.  Channels with Side Information at the Transmitter , 1958, IBM J. Res. Dev..

[4]  Shlomo Shamai,et al.  On joint source-channel coding for the Wyner-Ziv source and the Gel'fand-Pinsker channel , 2003, IEEE Trans. Inf. Theory.

[5]  Tsachy Weissman,et al.  Source Coding with Limited Side Information Lookahead at the Decoder , 2006, 2006 IEEE International Symposium on Information Theory.

[6]  Neri Merhav,et al.  On hierarchical joint source-channel coding with degraded side information , 2006, IEEE Transactions on Information Theory.

[7]  Amiram H. Kaspi,et al.  Rate-distortion function when side-information may be present at the decoder , 1994, IEEE Trans. Inf. Theory.

[8]  Toby Berger,et al.  Rate distortion when side information may be absent , 1985, IEEE Trans. Inf. Theory.

[9]  William Equitz,et al.  Successive refinement of information , 1991, IEEE Trans. Inf. Theory.

[10]  Shlomo Shamai,et al.  Systematic Lossy Source/Channel Coding , 1998, IEEE Trans. Inf. Theory.

[11]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[12]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[13]  Bixio Rimoldi,et al.  Successive refinement of information: characterization of the achievable rates , 1994, IEEE Trans. Inf. Theory.

[14]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[15]  Suhas N. Diggavi,et al.  Multistage successive refinement for Wyner-Ziv source coding with degraded side informations , 2006, 2006 IEEE International Symposium on Information Theory.

[16]  Neri Merhav,et al.  On successive refinement for the Wyner-Ziv problem , 2004, IEEE Transactions on Information Theory.

[17]  Suhas N. Diggavi,et al.  On Multistage Successive Refinement for Wyner–Ziv Source Coding With Degraded Side Informations , 2007, IEEE Transactions on Information Theory.