vix.ing · top · new · best · stats

Least squares quantization in PCM

1982/03/01 by S. Lloyd, Sheelagh Lloyd · 15,730 citations
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Algorithm #Amplitude #Applied mathematics #Coding theory and cryptography #Combinatorics #Error Correcting Code Techniques #Gaussian #Mathematics #Physics #Quantization (signal processing) #Quantum mechanics #Topology (electrical circuits)

paper · open access · doi:10.1109/tit.1982.1056489

published in IEEE Transactions on Information Theory 28(2), 129-137 (Institute of Electrical and Electronics Engineers)

openalex publication_date 1982/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

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 for2bquanta,b=1,2, ⋯, 7, are given numerically for Gaussian and for Laplacian distribution of signal amplitudes.

Cited by

Related