Computer Science – Information Theory
Scientific paper
2011-09-06
Computer Science
Information Theory
submitted
Scientific paper
For memoryless sources, delayed side information at the decoder does not improve the rate-distortion function. However, this is not the case for more general sources with memory, as demonstrated by a number of works focusing on the special case of (delayed) feedforward. In this paper, a setting is studied in which the encoder is potentially uncertain about the delay with which measurements of the side information are acquired at the decoder. Assuming a hidden Markov model for the sources, at first, a single-letter characterization is given for the set-up where the side information delay is arbitrary and known at the encoder, and the reconstruction at the destination is required to be (near) lossless. Then, with delay equal to zero or one source symbol, a single-letter characterization is given of the rate-distortion region for the case where side information may be delayed or not, unbeknownst to the encoder. The characterization is further extended to allow for additional information to be sent when the side information is not delayed. Finally, examples for binary and Gaussian sources are provided.
Permuter Haim H.
Simeone Osvaldo
No associations
LandOfFree
Source Coding When the Side Information May Be Delayed does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Source Coding When the Side Information May Be Delayed, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Source Coding When the Side Information May Be Delayed will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-305178