On the Rate Redundancy of Uniform Scalar Quantization and Golomb-Rice Coding

In this paper, we consider rate redundancy not only of uniform scalar quantizer (USQ) for the assumed Laplacian source, but also of USQ coupled with Golomb-Rice coding. For a given bit rate of USQ, we select the key parameter of the Golomb-Rice coder so that the rate redundancy of USQ with Golomb-Rice coding is minimal. We further determine and analyse the robustness of the rate redundancy to changes in the standard deviation mismatch over a relatively wide range of values. The analysis presented in the paper is very useful, since in numerous systems with limited memory resources, any savings achieved by means of compression can indeed be beneficial.