Random rotations clarify scaling in signal quantization methods

A Note on Scaling in Randomly Rotated Quantization and Its Connection to the CDEF +1 Pythagorean Relation

Information TheoryMachine Learning

Summary

Quantization is a way to simplify signals by approximating them with fewer values, but this process can introduce errors. The authors explain how using random rotations before quantization connects to well-known ideas in signal processing about how to best scale these approximations. They show that certain scaling factors used in previous work actually correspond to classic statistical methods but with exact unbiasedness guarantees. Their results also reveal how the properties seen in very large signals emerge from these random rotations as signal size grows. These insights help understand how random rotations can make quantization errors behave nicely.

What this means in practice

A theory result. No direct application yet.

Authors

Uri Erez

Abstract

Quantization schemes based on randomized rotations have recently received renewed attention, including the roles of MMSE and unbiased reconstruction scalings. In this note, we point out the connection to classical results in statistical signal processing and communication theory. Specifically, the two reconstruction scales used in the EDEN line of work admit a natural interpretation as finite-dimensional, realization-dependent counterparts of the Wiener and unbiased coefficients in the classical CDEF formulation. At finite blocklength, the CDEF +1 relation holds pointwise for each rotation realization as an exact geometric (Pythagorean) identity, but does not hold after averaging the distortions over the rotation. The classical SNR relation $\sf{SNR}_{\rm MMSE}=\sf{SNR}_{\rm MMSE,U}+1$ is recovered as $d\to\infty$: once the overall scale is handled separately, the empirical coordinate statistics of a randomly rotated vector approach their i.i.d. Gaussian counterparts, and the rotation-dependent quantities concentrate. Importantly, EDEN goes beyond this classical correspondence: for every finite $d$, its Haar-rotation formulation guarantees exact conditional unbiasedness, a stronger property than the second-order notion of unbiasedness in CDEF. We further comment on two distinct roles random rotations play in quantization: one is approximate Gaussianization of the coordinates; the other is decorrelation of reconstruction errors across quantization branches.