OpenAlex · Aktualisierung stündlich · Letzte Aktualisierung: 29.03.2026, 06:47

Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.

Least squares quantization in PCM

1982·15.285 Zitationen·IEEE Transactions on Information TheoryOpen Access
Volltext beim Verlag öffnen

15.285

Zitationen

1

Autoren

1982

Jahr

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 for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2^{b}</tex> quanta, <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b=1,2, \cdots, 7</tex> , are given numerically for Gaussian and for Laplacian distribution of signal amplitudes.

Ähnliche Arbeiten

Autoren

Institutionen

Themen

Coding theory and cryptographyAdvanced Wireless Communication TechniquesError Correcting Code Techniques
Volltext beim Verlag öffnen