English

Universal Gaussian Quantization with Side Information using Polar Lattices

Information Theory 2023-02-24 v3 math.IT

Abstract

We consider universal quantization with side information for Gaussian observations, where the side information is a noisy version of the sender's observation with noise variance unknown to the sender. In this paper, we propose a universally rate optimal and practical quantization scheme for all values of unknown noise variance. Our scheme uses Polar lattices from prior work, and proceeds based on a structural decomposition of the underlying auxiliaries so that even when recovery fails in a round, the parties agree on a common "reference point" that is closer than the previous one. We also present the finite blocklength analysis showing an sub-exponential convergence for distortion and exponential convergence for rate. The overall complexity of our scheme is O(N2log2N)O(N^2\log^2 N) for any target distortion and fixed rate larger than the rate-distortion bound.

Keywords

Cite

@article{arxiv.2103.02335,
  title  = {Universal Gaussian Quantization with Side Information using Polar Lattices},
  author = {Shubham Jha},
  journal= {arXiv preprint arXiv:2103.02335},
  year   = {2023}
}

Comments

Accepted version to IEEE Journal on Selected Areas in Information Theory - Special Issue on Modern Compression. Minor changes to previous version

R2 v1 2026-06-23T23:42:21.266Z