Source coding when the side information may be delayed

Osvaldo Simeone, Haim Henri Permuter

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

For memoryless sources, delayed side information at the decoder does not improve the rate-distortion function. However, this is not the case for 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, which is available at the encoder, are acquired at the decoder. Assuming a hidden Markov model for the source sequences, at first, a single-letter characterization is given for the setup where the side information delay is arbitrary and known at the encoder, and the reconstruction at the destination is required to be asymptotically lossless. Then, with delay equal to zero or one source symbol, a single-letter characterization of the rate-distortion region is given for the case where, unbeknownst to the encoder, the side information may be delayed or not. Finally, examples for binary and Gaussian sources are provided.

Original languageEnglish (US)
Article number6468092
Pages (from-to)3607-3618
Number of pages12
JournalIEEE Transactions on Information Theory
Volume59
Issue number6
DOIs
StatePublished - 2013

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Keywords

  • Causal conditioning
  • Markov Gaussian process
  • hidden Markov model
  • multiplexing
  • rate-distortion function
  • strictly causal side information

Fingerprint

Dive into the research topics of 'Source coding when the side information may be delayed'. Together they form a unique fingerprint.

Cite this