Universal Wyner-Ziv coding of discrete memoryless sources with known side information statistics

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider a universal variant of the Wyner-Ziv problem of lossy source coding with decoder side information, where the marginal distribution of the side information is known, while the conditional distribution of the source sequence given the side information is only assumed to lie in a given parametric family. Our approach combines minimum-distance channel estimation with a recent scheme of Jalali, Verdú and Weissman based on discrete universal denoising with auxiliary information. Our scheme is universal under mild regularity conditions. We also give a concrete example of a family of sources satisfying the regularity conditions.

Original languageEnglish (US)
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages2167-2171
Number of pages5
DOIs
StatePublished - Sep 29 2008
Externally publishedYes
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: Jul 6 2008Jul 11 2008

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Other

Other2008 IEEE International Symposium on Information Theory, ISIT 2008
CountryCanada
CityToronto, ON
Period7/6/087/11/08

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Universal Wyner-Ziv coding of discrete memoryless sources with known side information statistics'. Together they form a unique fingerprint.

Cite this