DMCA
Least squares quantization in pcm (1982)
Cached
Download Links
- [mlsp.cs.cmu.edu]
- [www.cs.toronto.edu]
- [www-evasion.imag.fr]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Transactions on Information Theory |
| Citations: | 1362 - 0 self |
BibTeX
@ARTICLE{Lloyd82leastsquares,
author = {Stuart P. Lloyd},
title = {Least squares quantization in pcm},
journal = {IEEE Transactions on Information Theory},
year = {1982},
volume = {28},
pages = {129--137}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract-It has long been realized that in pulse-code modulation (PCM), with a given ensemble of signals to handle, the quantum values should be spaced more closely in the voltage regions where the signal amplitude is more likely to fall. It has been shown by Panter and Dite that, in the limit as the number of quanta becomes infinite, the asymptotic fractional density of quanta per unit voltage should vary as the one-third power of the probability density per unit voltage of signal amplitudes. In this paper the corresponding result for any finite number of quanta is derived; that is, necessary conditions are found that the quanta and associated quantization intervals of an optimum finite quantization scheme must satisfy. The optimization criterion used is that the average quantization noise power be a minimum. It is shown that the result obtained here goes over into the Panter and Dite result as the number of quanta become large. The optimum quantization schemes for 26 quanta, b = 1,2, t,7, are given numerically for Gaussian and for Laplacian distribution of signal amplitudes. T I.
Keyphrases
signal amplitude unit voltage asymptotic fractional density quantization interval dite result quantum value optimum quantization scheme voltage region one-third power probability density quantum becomes corresponding result laplacian distribution optimum finite quantization scheme necessary condition optimization criterion average quantization noise power pulse-code modulation finite number
