A Universal Scheme for Wyner–Ziv Coding of Discrete Sources

Creators: Jalali, Shirin; Verdú, Sergio; Weissman, Tsachy

Abstract

We consider the Wyner–Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding algorithms is proposed and their universal optimality is proven. Compression consists of sliding-window processing followed by Lempel–Ziv (LZ) compression, while the decompressor is based on a modification of the discrete universal denoiser (DUDE) algorithm to take advantage of side information. The new algorithms not only universally attain the fundamental limits, but also suggest a paradigm for practical WZ coding. The effectiveness of our approach is illustrated with experiments on binary images, and English text using a low complexity algorithm motivated by our class of universally optimal WZ codes.

Additional Information

© 2010 IEEE. Manuscript received February 28, 2008; revised November 19, 2009. Current version published March 17, 2010. The work of S. Jalali was supported by Stanford Graduate Fellowship. The work of S. Verdú was supported by the NSF under Grant CCR-0312839, National Science Foundation, Theoretical Foundations Research Grants CCF-0635154 and CCF-0728445. The work of T. Weissman was supported by an NSF CAREER grant. The authors would like to thank E. Ordentlich and P.Vontobel for the helpful discussions. The authors also would like to thank the anonymous reviewers for their helpful comments.

Attached Files

Published - Jalali2010p7459Ieee_T_Inform_Theory.pdf

Files

Jalali2010p7459Ieee_T_Inform_Theory.pdf

Files (778.6 kB)

Name	Size	Download all
Jalali2010p7459Ieee_T_Inform_Theory.pdf md5:4c8746810229d15dab805fd46f9bb13d	778.6 kB	Preview Download

Additional details

	All versions	This version
Views	0	0
Downloads	0	0
Data volume	0 Bytes	0 Bytes