The likelihood encoder for lossy compression

Eva C. Song, Paul Cuff, H. Vincent Poor

Research output: Contribution to journalArticle

39 Scopus citations

Abstract

A likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on the soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering lemma yields simple achievability proofs for classical source coding problems. The cases of the point-to-point rate-distortion function, the rate-distortion function with side information at the decoder (i.e., the Wyner-Ziv problem), and the multi-terminal source coding inner bound (i.e., the Berger-Tung problem) are examined in this paper. Furthermore, a non-asymptotic analysis is used for the point-to-point case to examine the upper bound on the excess distortion provided by this method. The likelihood encoder is also related to a recent alternative technique using the properties of random binning.

Original languageEnglish (US)
Article number7406745
Pages (from-to)1836-1849
Number of pages14
JournalIEEE Transactions on Information Theory
Volume62
Issue number4
DOIs
StatePublished - Apr 2016

All Science Journal Classification (ASJC) codes

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

Keywords

  • Berger-Tung
  • Wyner-Ziv
  • likelihood encoder
  • rate-distortion theory
  • soft-covering
  • source coding

Fingerprint Dive into the research topics of 'The likelihood encoder for lossy compression'. Together they form a unique fingerprint.

Cite this