To refer to this page use:
|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.|
|Citation:||Song, Eva C, Cuff, Paul, Poor, H Vincent. (The Likelihood Encoder for Lossy Compression. IEEE Transactions on Information Theory, 62(4), 1836-1849, 2016, doi:10.1109/TIT.2016.2529657|
|Type of Material:||Journal Article|
|Journal/Proceeding Title:||IEEE Transactions on Information Theory|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.