The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Least squares quantization in PCM
Open accessAbstract
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 quautization schemes for2^{b}quanta,b=1,2, \cdots, 7, are given numerically for Gaussian and for Laplacian distribution of signal amplitudes.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The text we found for this paper looks like another document, so the self-check wasn’t run.
Citations
Cites
Mathematical Methods of Statistics.
Geary, R. C., & Cramer, H. (1947) · The Economic Journal · doi:10.2307/2226151 · Cited by 5,927
Oliver, B. M., Pierce, J. R., & Shannon, C. E. (1948) · Proceedings of the IRE · doi:10.1109/jrproc.1948.231941 · Cited by 273
A Generalized Sampling Theorem
Kramer, H. P. (1959) · Studies in Applied Mathematics · doi:10.1002/sapm195938168 · Cited by 249
Quantization Distortion in Pulse-Count Modulation with Nonuniform Spacing of Levels
Panter, P. F., & Dite, W. (1951) · Proceedings of the IRE · doi:10.1109/jrproc.1951.230419 · Cited by 225
On a Generalized Sampling Theorem
Takizawa, É. I. (1975) · Journal of the Japan Society of Precision Engineering · doi:10.2493/jjspe1933.41.1050 · Cited by 208
Instantaneous companding of quantized signals
Smith, B. (1957) · The Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb03858.x · Cited by 198
Kač, M. (1934) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-9.2.116 · Cited by 183
A SIMPLE PROOF AND SOME EXTENSIONS OF THE SAMPLING THEOREM
Parzen, E. (1956) · Defense Technical Information Center (DTIC) · doi:10.21236/ad0117999 · Cited by 48
The Comparison of Measured and Calculated Solar Radiations in Trabzon, Turkey
Kaygusuz, K. (1999) · Energy Sources · doi:10.1080/00908319950014830 · Cited by 47
Research works printed but not linked: 7
- 1956, Math Rev, 17, 757
- sch�tzenberger, 1954, Pub de l'Inst de Statis, 3, 56
- fleischer, 1964, Sufficient conditions for achieving minimum distortion in quantizer, IEEE Int Convention Record, 12, 104
- doob, 1953, Stochastic Processes
- lloyd, 1956, Linear least squares filtering and prediction of sampled signals, Symp Modern Network Synthesis, 5, 221
- zygmund, 1955, Trigonometrical Series, 47
- black, 1953, Modulation Theory
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“The procedure, as described, proceeds deterministically from the given initial partition, as one shifts systematically the vertex with lowest fitness, and is likely to get trapped in local optima.”
MethodData clustering: 50 years beyond K-means
Jain, A. K. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.011 · Cited by 9,368
SLIC Superpixels Compared to State-of-the-Art Superpixel Methods
Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., & Süsstrunk, S. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.120 · Cited by 9,201
Metadata
- Authors
- Lloyd, S.
- Affiliations
- AT&T (United States) (US)
- Corresponding author
- Lloyd, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1982-03
- Volume
- 28
- Issue
- 2
- Pages
- 129-137
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2150593711
- Cited by
- 15,836
- References
- 9
- Citations by year
- 2026: 964 · 2025: 1161 · 2024: 1087 · 2023: 1243 · 2022: 1145 · 2021: 1244 · 2020: 1139 · 2019: 1089 · 2018: 887 · 2017: 731 · 2016: 662 · 2015: 573 · 2014: 524 · 2013: 488 · 2012: 507
- FWCI
- 29.12
- Type
- journal article
- Language
- en
- Open access
- green
- hal.science
- Licence
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- HAL (submittedVersion, other-oa)
- IEEE Trans.
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
- Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Signal Processing Techniques
- Keywords
- pulse code modulation, optimal quantization, normal distribution, Laplacian distribution
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.