Refined Asymptotics for Rate-Distortion Using Gaussian Codebooks for Arbitrary Sources

DOI10.1109/TIT.2018.2886959MaRDI QIDQ5223990zbMATH OpenOpenAlexWikidataFDO

Authors Lin Zhou, Vincent Y. F. Tan, Mehul Motani

Publication date 19 July 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1708.04778

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Abstract: The rate-distortion saddle-point problem considered by Lapidoth (1997) consists in finding the minimum rate to compress an arbitrary ergodic source when one is constrained to use a random Gaussian codebook and minimum (Euclidean) distance encoding is employed. We extend Lapidoth's analysis in several directions in this paper. Firstly, we consider refined asymptotics. In particular, when the source is stationary and memoryless, we establish the second-order, moderate, and large deviation asymptotics of the problem. Secondly, by "random Gaussian codebook", Lapidoth referred to a collection of random codewords, each of which is drawn independently and uniformly from the surface of an $n$-dimensional sphere. To be more precise, we term this as a spherical codebook. We also consider i.i.d. Gaussian codebooks in which each random codeword is drawn independently from a product Gaussian distribution. We derive the second-order, moderate, and large deviation asymptotics when i.i.d. Gaussian codebooks are employed. In contrast to the recent work on the channel coding counterpart by Scarlett, Tan and Durisi (2017), the dispersions for spherical and i.i.d. Gaussian codebooks are identical. The ensemble excess-distortion exponents for both spherical and i.i.d. Gaussian codebooks are established for all rates. Furthermore, we show that the i.i.d. Gaussian codebook has a strictly larger excess-distortion exponent than its spherical counterpart for any rate greater than the ensemble rate-distortion function derived by Lapidoth.

Cited in

(6)

• Compressors for combined source and channel coding with applications to the generalized Gaussian family (Corresp.)
• Distortion-rate bounds for fixed- and variable-rate multiresolution source codes
• Distortion Minimization in Gaussian Layered Broadcast Coding With Successive Refinement
• Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems
• Improved Upper Bounds to the Causal Quadratic Rate-Distortion Function for Gaussian Stationary Sources
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources

This page was built for publication: Refined Asymptotics for Rate-Distortion Using Gaussian Codebooks for Arbitrary Sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223990)