Efficient scalar quantization of exponential and Laplacian random variables
- 1 January 1996
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 42 (5), 1365-1374
- https://doi.org/10.1109/18.532878
Abstract
This paper presents solutions to the entropy-constrained scalar quantizer (ECSQ) design problem for two sources commonly encountered in image and speech compression applications: sources having the exponential and Laplacian probability density functions. We use the memoryless property of the exponential distribution to develop a new noniterative algorithm for obtaining the optimal quantizer design. We show how to obtain the optimal ECSQ either with or without an additional constraint on the number of levels in the quantizer. In contrast to prior methods, which require multidimensional iterative solution of a large number of nonlinear equations, the new method needs only a single sequence of solutions to one-dimensional nonlinear equations (in some Laplacian cases, one additional two-dimensional solution is needed). As a result, the new method is orders of magnitude faster than prior ones, We show that as the constraint on the number of levels in the quantizer is relaxed, the optimal ECSQ becomes a uniform threshold quantizer (UTQ) for exponential, but not for Laplacian sources. We then further examine the performance of the UTQ and optimal ECSQ, and also investigate some interesting alternatives to the UTQ, including a uniform-reconstruction quantizer (URQ) and a constant dead-zone ratio quantizer (CDZRQ).Keywords
This publication has 14 references indexed in Scilit:
- Optimal entropy constrained scalar quantization for exponential and Laplacian random variablesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient bit allocation for an arbitrary set of quantizers (speech coding)IEEE Transactions on Acoustics, Speech, and Signal Processing, 1988
- Optimum quantizer performance for a class of non-Gaussian memoryless sourcesIEEE Transactions on Information Theory, 1984
- Minimum entropy quantizers and permutation codesIEEE Transactions on Information Theory, 1982
- Comments on "Quantizing characteristics for signals having Laplacian amplitude probability density function"IEEE Transactions on Communications, 1979
- Quantizing Characteristics for Signals Having Laplacian Amplitude Probability Density FunctionIEEE Transactions on Communications, 1978
- Optimum quantizers and permutation codesIEEE Transactions on Information Theory, 1972
- Minimum Mean-Squared-Error Quantization in Speech PCM and DPCM SystemsIEEE Transactions on Communications, 1972
- Asymptotically efficient quantizingIEEE Transactions on Information Theory, 1968
- Quantizing for minimum distortionIEEE Transactions on Information Theory, 1960