Two lossy source coding problems with causal side-information
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
On successive refinement for the Kaspi/Heegard-Berger problem
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
Consider a process, {Xi Yi,Zi}infin i=1 producing independent copies of a triplet of jointly distributed random variables (RVs). The part of the process - the source - is observed at the encoder, and is supposed to be reproduced at two decoders, decoder 1 and decoder 2, where the {Zi} and the {Yi} parts of the process are observed, respectively, in a causal manner. The communication between the encoder and the decoders is carried out across two memoryless channels in two successive communication stages. In the first stage, the compressed transmission is available to both decoders, but only decoder 1 reconstructs the source (according to the received data stream and its causal side information (SI){Zi}). In the second stage, the second decoder reconstructs the source according to {Yi} and the transmissions of the encoder at both stages. It is desired to find necessary and sufficient conditions such that the distortions incurred (in each stage) will not exceed given thresholds. First, a single-letter characterization of achievable rates is derived for a pure source-coding problem with successive refinement and causal SI at the decoders. Then, for a joint source-channel coding setting, a separation theorem is proved, asserting that in the limit of long blocks, no optimality is lost by first applying lossy successive-refinement source coding, regardless of the channels, and then applying good channel codes to each one of the resulting bit streams, regardless of the source. Next, conditions for a source to be successively refinable in two different senses are established, and finally, it is shown that the binary-symmetric source is successively refinable.