Least squares quantization in PCM
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
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 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
Items 1,001–1,045 of 1,045
Machine Unlearning for Random Forests
Brophy, J., & Lowd, D. (2020) · arXiv · doi:10.48550/arxiv.2009.05567 · Cited by 70
“(2019) developed a quantized variant of the k-means (Lloyd 1982) algorithm called Q-k-means that supports exact data deletion; their method relies on the notion of model stability, with the assumption that the deletion of a small enough proportion of data should not cause a large change in the learned model.”
Aircraft fuel burn performance study: A data-enhanced modeling approach
Yanto, J., & Liem, R. P. (2018) · Transportation Research Part D Transport and Environment · doi:10.1016/j.trd.2018.09.014 · Cited by 70
Token Merging: Your ViT But Faster
Bolya, D., Fu, C.-Y., Dai, X., Zhang, P., Feichtenhofer, C., & Hoffman, J. (2022) · arXiv · doi:10.48550/arxiv.2210.09461 · Cited by 140
“There are several potential solutions to this problem, such as kmeans clustering (Lloyd, 1982) or graph cuts (Boykov et al.”
BackgroundMapping the Substrate Recognition Pathway in Cytochrome P450
(2018) · doi:10.1021/jacs.8b10840 · Cited by 60
Mapping the Substrate Recognition Pathway in Cytochrome P450
Ahalawat, N., & Mondal, J. (2018) · doi:10.1101/416305 · Cited by 60
Open-Ended Learning Leads to Generally Capable Agents
Open Ended Learning Team, Stooke, A., Mahajan, A., Barros, C., Deck, C., Bauer, J., Sygnowski, J., Trebacz, M., Jaderberg, M., Mathieu, M., et al. (2021) · arXiv · doi:10.48550/arxiv.2107.12808 · Cited by 56
AHaH Computing–From Metastable Switches to Attractors to Machine Learning
Nugent, M. A., & Molter, T. W. (2014) · PLoS ONE · doi:10.1371/journal.pone.0085175 · Cited by 55
Swarm Intelligence Techniques in Recommender Systems-a Review of Recent Research
Peška, L., Tashu, T. M., & Horváth, T. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.003 · Cited by 54
Thorgeirsson, A. T., Scheubner, S., Funfgeld, S., & Gauterin, F. (2021) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2021.3065529 · Cited by 54
A distributed spatial method for modeling maritime routes
Zissis, D., Chatzikokolakis, K., Spiliopoulos, G., & Vodas, M. (2020) · IEEE Access · doi:10.1109/access.2020.2979612 · Cited by 53
“The partitioning clustering algorithm we use in our methodology is an adaptation of K-Means, using the previous formulation to automatically estimate the k parameter to cluster AIS positions based on longitude and latitude [38].”
MethodAutoDMP: Automated DREAMPlace-based Macro Placement
Agnesina, A., Rajvanshi, P., Yang, T., Pradipta, G., Jiao, A., Keller, B., Khailany, B., & Ren, H. (2023) · Proceedings of the 2023 International Symposium on Physical Design · doi:10.1145/3569052.3578923 · Cited by 52
Learning tactile skills through curious exploration
Pape, L., Oddo, C. M., Controzzi, M., Cipriani, C., Förster, A., Carrozza, M. C., & Schmidhuber, J. (2012) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2012.00006 · Cited by 51
“The abstractor used for distinguishing tactile events is a k -means clustering algorithm (Lloyd, 1982) that partitions the spectra into k clusters y 1 , . . . , y k , with k ∈ { 3 , 4 , 5 } .”
MethodContrastive Learning Models for Sentence Representations
Xu, L., Xie, H., Li, Z., Wang, F. L., Wang, W., & Li, Q. (2023) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3593590 · Cited by 50
“these short text datasets(6) using the well-known algorithm k-means [64, 67] owing to its simplicity.”
MethodPattern Recognition Techniques for Boson Sampling Validation
Agresti, I., Viggianiello, N., Flamini, F., Spagnolo, N., Crespi, A., Osellame, R., Wiebe, N., & Sciarrino, F. (2019) · Physical Review X · doi:10.1103/physrevx.9.011013 · Cited by 50
Deep learning in spatial transcriptomics: Learning from the next next-generation sequencing
Heydari, A. A., & Sindi, S. S. (2023) · Biophysics Reviews · doi:10.1063/5.0091135 · Cited by 44
Deep Learning in Spatial Transcriptomics: Learning From the Next Next-Generation Sequencing
Heydari, A. A., & Sindi, S. S. (2022) · doi:10.1101/2022.02.28.482392 · Cited by 44
Ali, M. R., Sen, T., Kane, B., Bose, S., Carroll, T. M., Epstein, R., Schubert, L., & Hoque, E. (2023) · IEEE Transactions on Affective Computing · doi:10.1109/taffc.2021.3054717 · Cited by 40
“exist, we applied the k-means clustering algorithm ([44]).”
MethodWorkflow for generating competing hypothesis from models with parameter uncertainty
Gomez-Cabrero, D., Compte, A., & Tegner, J. (2011) · Interface Focus · doi:10.1098/rsfs.2011.0015 · Cited by 33
The Effect of Audiences on the User Experience with Conversational Interfaces in Physical Spaces
Candello, H., Pinhanez, C., Pichiliani, M., Cavalin, P., Figueiredo, F., Vasconcelos, M., & Do Carmo, H. (2019) · Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3290605.3300320 · Cited by 33
“We compared different methods such as K-Means [22], Spectral Clustering [26], and Hierarchical Dirichlet Process [46].”
MethodAutodetection of ancient Arabian tombs in high-resolution satellite imagery
Schuetter, J., Goel, P., McCorriston, J., Park, J., Senn, M., & Harrower, M. (2013) · International Journal of Remote Sensing · doi:10.1080/01431161.2013.802054 · Cited by 33
Explainable outlier detection: What, for Whom and Why?
Sejr, J. H., & Schneider-Kamp, A. (2021) · Machine Learning with Applications · doi:10.1016/j.mlwa.2021.100172 · Cited by 32
Automated classification of cellular expression in multiplexed imaging data with Nimbus
(2025) · doi:10.1038/s41592-025-02826-9 · Cited by 24
Differential Privacy Defenses and Sampling Attacks for Membership Inference
Rahimian, S., Orekondy, T., & Fritz, M. (2021) · Proceedings of the 14th ACM Workshop on Artificial Intelligence and Security · doi:10.1145/3474369.3486876 · Cited by 24
Atomistic Insights into Structural Differences between E3 and E4 Isoforms of Apolipoprotein E
Ray, A., Ahalawat, N., & Mondal, J. (2017) · Biophysical Journal · doi:10.1016/j.bpj.2017.10.006 · Cited by 23
“(45) was used to discretize this 4D data into 70 microstates.”
MethodPV-integration strategies for low voltage networks
Heinrich, C., Fortenbacher, P., Fuchs, A., & Andersson, G. (2016) · 2016 IEEE International Energy Conference (ENERGYCON) · doi:10.1109/energycon.2016.7514141 · Cited by 23
Monitoring AI Services for Misuse
Javadi, S. A., Norval, C., Cloete, R., & Singh, J. (2021) · Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society · doi:10.1145/3461702.3462566 · Cited by 21
“KMeans [29] and Gaussian Mixture Model (GMM) [35].”
MethodTESTA: Temporal-Spatial Token Aggregation for Long-form Video-Language Understanding
Ren, S., Chen, S., Li, S., Sun, X., & Hou, L. (2023) · arXiv · doi:10.48550/arxiv.2310.19060 · Cited by 20
Spatiotemporal integration of looming visual and tactile stimuli near the face
Huang, R., Chen, C., & Sereno, M. I. (2018) · Human Brain Mapping · doi:10.1002/hbm.23995 · Cited by 17
“The k-means algorithm was then used to cluster the p SjT5tmð Þ curves (m51; . . . ; 10) into three groups (Lloyd, 1982; see Discussion).”
MethodXie, R., Pang, K., Bader, G. D., & Wang, B. (2023) · 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52729.2023.00321 · Cited by 17
Assessing AF2’s ability to predict structural ensembles of proteins
Riccabona, J. R., Spoendlin, F. C., Fischer, A.-L. M., Loeffler, J. R., Quoika, P. K., Jenkins, T. P., Ferguson, J. A., Smorodina, E., Laustsen, A. H., Greiff, V., et al. (2024) · Structure · doi:10.1016/j.str.2024.09.001 · Cited by 17
Reconciling conformational heterogeneity and substrate recognition in cytochrome P450
Dandekar, B. R., Ahalawat, N., & Mondal, J. (2021) · Biophysical Journal · doi:10.1016/j.bpj.2021.02.040 · Cited by 14
Phylogenetic tree reconstruction via graph cut presented using a quantum-inspired computer
Onodera, W., Hara, N., Aoki, S., Asahi, T., & Sawamura, N. (2023) · Molecular Phylogenetics and Evolution · doi:10.1016/j.ympev.2022.107636 · Cited by 13
Hastings, B. T., Melnyk, A., Ghyabi, M., White, E., Barroso, F. M., Carretero, M. A., Lattanzi, D., Claude, J., & Chiari, Y. (2023) · Biology Open · doi:10.1242/bio.060114 · Cited by 11
Utgés, J. S., MacGowan, S. A., Ives, C. M., & Barton, G. J. (2024) · Communications Biology · doi:10.1038/s42003-024-05970-8 · Cited by 10
(2020) · arXiv (Cornell University) · Cited by 7
Vrba, J., Steinbach, J., Jirsa, T., Verde, L., De Fazio, R., Zeng, Y., Ichiji, K., Hájek, L., Sedláková, Z., Urbániová, Z., et al. (2025) · Journal of Voice · doi:10.1016/j.jvoice.2025.03.028 · Cited by 6
“K-means SMOTE is an advanced oversampling method that combines the clustering capabilities of k-means [46] with the synthetic data generation process of SMOTE [47].”
Improving Manning's n in Flood Models Using 3D Point Clouds, Flume Experiments, and Deep Learning
Haces‐Garcia, F., Kotzamanis, V., Glennie, C. L., & Rifai, H. S. (2025) · Water Resources Research · doi:10.1029/2024wr037665 · Cited by 6
TBAL: Two-stage batch-mode active learning for image classification
Shen, Y., Song, Y., Wu, C.-H., & Kuo, C.-C. J. (2022) · Signal Processing: Image Communication · doi:10.1016/j.image.2022.116731 · Cited by 6
Identifying Selectivity Filters in Protein Biosensor for Ligand Screening
Sahil, M., Singh, J., Sahu, S., Pal, S. K., Yadav, A., Anand, R., & Mondal, J. (2023) · JACS Au · doi:10.1021/jacsau.3c00374 · Cited by 6
CiteME: Can Language Models Accurately Cite Scientific Claims?
Press, O., Hochlehnert, A., Prabhu, A., Udandarao, V., Press, O., & Bethge, M. (2024) · arXiv · doi:10.48550/arxiv.2407.12861 · Cited by 4
“We apply an exact kNN [53] match to identify the closest embedding, computing the cosine similarity between the embeddings of text excerpt and all available papers (title and abstract).”
MethodAssessing AF2’s ability to predict structural ensembles of proteins
Riccabona, J. R., Spoendlin, F. C., Fischer, A.-L. M., Loeffler, J. R., Quoika, P. K., Jenkins, T. P., Ferguson, J. A., Smorodina, E., Laustsen, A. H., Greiff, V., et al. (2024) · doi:10.1101/2024.04.16.589792 · Cited by 2
Kang, G., Ge, Z., Hu, J., Zhang, X., Wang, L., & Zhan, J. (2025) · Proceedings of the VLDB Endowment · doi:10.14778/3718057.3718078 · Cited by 1
CodeEvolve: an open source evolutionary coding agent for algorithmic discovery and optimization
Assumpção, H., Ferreira, D., Campos, L., & Murai, F. (2025) · arXiv · doi:10.48550/arxiv.2510.14150
TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
Zandieh, A., Daliri, M., Hadian, M., & Mirrokni, V. (2025) · arXiv · doi:10.48550/arxiv.2504.19874
Clio: Privacy-Preserving Insights into Real-World AI Use
Tamkin, A., McCain, M., Handa, K., Durmus, E., Lovitt, L., Rathi, A., Huang, S., Mountfield, A., Hong, J., Ritchie, S., et al. (2024) · arXiv · doi:10.48550/arxiv.2412.13678
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.