On universal quantization
- 1 May 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 31 (3) , 344-347
- https://doi.org/10.1109/tit.1985.1057034
Abstract
The quantization ofn-dimensional vectors inR^{n}with an arbitrary probability measure, under a mean-square error constraint, is discussed. It is demonstrated that a uniform, one-dimensional quantizer followed by a noiseless digital variable-rate encoder ("entropy encoding") can yield a rate that is, for anyn, no more than0.754bit-per-sample higher than the rate associated with the optimaln-dimensionai quantizer, regardless of the probabilistic characterization of the inputn-vector for the allowable mean-square error.Keywords
This publication has 7 references indexed in Scilit:
- Fast quantizing and decoding and algorithms for lattice quantizers and codesIEEE Transactions on Information Theory, 1982
- On the structure of vector quantizersIEEE Transactions on Information Theory, 1982
- Voronoi regions of lattices, second moments of polytopes, and quantizationIEEE Transactions on Information Theory, 1982
- An Algorithm for Vector Quantizer DesignIEEE Transactions on Communications, 1980
- Asymptotically optimal block quantizationIEEE Transactions on Information Theory, 1979
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- Asymptotically efficient quantizingIEEE Transactions on Information Theory, 1968