2000 character limit reached
One-Shot Wyner-Ziv Compression of a Uniform Source
Published 2 May 2024 in cs.IT and math.IT | (2405.01774v1)
Abstract: In this paper, we consider the one-shot version of the classical Wyner-Ziv problem where a source is compressed in a lossy fashion when only the decoder has access to a correlated side information. Following the entropy-constrained quantization framework, we assume a scalar quantizer followed by variable length entropy coding. We consider compression of a uniform source, motivated by its role in the compression of processes with low-dimensional features embedded within a high-dimensional ambient space. We find upper and lower bounds to the entropy-distortion functions of the uniform source for quantized and noisy side information, and illustrate tightness of the bounds at high compression rates.
- D. Slepian and J. Wolf, “Noiseless coding of correlated information sources,” IEEE Transactions on Information Theory, vol. 19, no. 4, pp. 471–480, 1973.
- A. Wyner and J. Ziv, “The rate-distortion function for source coding with side information at the decoder,” IEEE Transactions on Information Theory, vol. 22, no. 1, pp. 1–10, 1976.
- V. Kostina and S. Verdú, “Fixed-length lossy compression in the finite blocklength regime,” IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 3309–3338, 2012.
- C. T. Li and V. Anantharam, “A unified framework for one-shot achievability via the Poisson matching lemma,” IEEE Transactions on Information Theory, vol. 67, no. 5, pp. 2624–2651, 2021.
- G. J. Sullivan, “Efficient scalar quantization of exponential and laplacian random variables,” IEEE Transactions on Information Theory, vol. 42, no. 5, pp. 1365–1374, 1996.
- P. A. Chou, T. Lookabaugh, and R. M. Gray, “Entropy-constrained vector quantization,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 37, no. 1, pp. 31–42, 1989.
- A. Gyorgy and T. Linder, “Optimal entropy-constrained scalar quantization of a uniform source,” IEEE Transactions on Information Theory, vol. 46, no. 7, pp. 2704–2711, 2000.
- A. B. Wagner and J. Ballé, “Neural networks optimally compress the sawbridge,” in 2021 Data Compression Conference (DCC). IEEE, 2021, pp. 143–152.
- S. Bhadane, A. B. Wagner, and J. Ballé, “Do neural networks compress manifolds optimally?” in 2022 IEEE Information Theory Workshop (ITW). IEEE, 2022, pp. 582–587.
- S. D. Servetto, “Lattice quantization with side information: Codes, asymptotics, and applications in sensor networks,” IEEE Transactions on Information Theory, vol. 53, no. 2, pp. 714–731, 2007.
- Z. Tu, T. J. Li, and R. S. Blum, “On scalar quantizer design with decoder side information,” in 2006 40th Annual Conference on Information Sciences and Systems, 2006, pp. 224–229.
- O. J. Hénaff, J. Ballé, N. C. Rabinowitz, and E. P. Simoncelli, “The local low-dimensionality of natural images,” arXiv preprint arXiv:1412.6626, 2014.
- E. Ozyilkan, J. Ballé, and E. Erkip, “Neural distributed compressor does binning,” in 2023 ICML Workshop Neural Compression: From Information Theory to Applications, 2023. [Online]. Available: https://openreview.net/forum?id=3Dq4FZJSga
- ——, “Learned Wyner–Ziv compressors recover binning,” in 2023 IEEE International Symposium on Information Theory (ISIT), 2023, pp. 701–706.
- ——, “Neural distributed compressor discovers binning,” IEEE Journal on Selected Areas in Information Theory, pp. 1–1, 2024.
- S. Pradhan and K. Ramchandran, “Distributed source coding using syndromes (DISCUS): Design and construction,” IEEE Transactions on Information Theory, vol. 49, no. 3, pp. 626–643, 2003.
- Z. Liu, S. Cheng, A. Liveris, and Z. Xiong, “Slepian-Wolf coded nested lattice quantization for Wyner-Ziv coding: High-rate performance analysis and code design,” IEEE Transactions on Information Theory, vol. 52, no. 10, pp. 4358–4379, 2006.
- A. Liveris, Z. Xiong, and C. Georghiades, “Compression of binary sources with side information at the decoder using LDPC codes,” IEEE Communications Letters, vol. 6, no. 10, pp. 440–442, 2002.
- Z. Tu, J. Li, and R. Blum, “Compression of a binary source with side information using parallelly concatenated convolutional codes,” in IEEE Global Telecommunications Conference, 2004. GLOBECOM ’04., vol. 1, 2004, pp. 46–50.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
