Quantization (signal processing)

Short description: Process of mapping a continuous set to a countable set

The simplest way to quantize a signal is to choose the digital amplitude value closest to the original analog amplitude. This example shows the original analog signal (green), the quantized signal (black dots), the signal reconstructed from the quantized signal (yellow) and the difference between the original signal and the reconstructed signal (red). The difference between the original signal and the reconstructed signal is the quantization error and, in this simple quantization scheme, is a deterministic function of the input signal.

Quantization, in mathematics and digital signal processing, is the process of mapping input values from a large set (often a continuous set) to output values in a (countable) smaller set, often with a finite number of elements. Rounding and truncation are typical examples of quantization processes. Quantization is involved to some degree in nearly all digital signal processing, as the process of representing a signal in digital form ordinarily involves rounding. Quantization also forms the core of essentially all lossy compression algorithms.

The difference between an input value and its quantized value (such as round-off error) is referred to as quantization error. A device or algorithmic function that performs quantization is called a quantizer. An analog-to-digital converter is an example of a quantizer.

## Contents

* 1 Example
* 2 Mathematical properties
* 3 Types
* 3.1 Analog-to-digital converter
* 3.2 Rate–distortion optimization
* 3.3 Mid-riser and mid-tread uniform quantizers
* 3.4 Dead-zone quantizers
* 4 Noise and error characteristics
* 4.1 Additive noise model
* 4.2 Quantization error models
* 4.3 Quantization noise model
* 5 Design
* 5.1 Granular distortion and overload distortion
* 5.2 Rate–distortion quantizer design
* 5.3 Neglecting the entropy constraint: Lloyd–Max quantization
* 5.4 Uniform quantization and the 6 dB/bit approximation
* 6 In other fields
* 7 See also
* 8 Notes
* 9 References
* 10 Further reading
* 11 See also

## Example

For example, rounding a real number x to the nearest integer value forms a very basic type of quantizer – a uniform one. A typical (mid-tread) uniform quantizer with a quantization step size equal to some value Δ can be expressed as

Q(x)=Δ⋅⌊xΔ+12⌋,

where the notation ⌊ ⌋ denotes the floor function.

Alternatively, the same quantizer may be expressed in terms of the ceiling function, as

Q(x)=Δ⋅⌈xΔ−12⌉.

(The notation ⌈ ⌉ denotes the ceiling function).

The essential property of a quantizer is having a countable-set of possible output-values members smaller than the set of possible input values. The members of the set of output values may have integer, rational, or real values. For simple rounding to the nearest integer, the step size Δ is equal to 1. With Δ=1 or with Δ equal to any other integer value, this quantizer has real-valued inputs and integer-valued outputs.

When the quantization step size (Δ) is small relative to the variation in the signal being quantized, it is relatively simple to show that the mean squared error produced by such a rounding operation will be approximately Δ2/12.[1][2][3][4][5][6] Mean squared error is also called the quantization noise power. Adding one bit to the quantizer halves the value of Δ, which reduces the noise power by the factor ¼. In terms of decibels, the noise power change is 10⋅log10(1/4) ≈ −6 dB.

Because the set of possible output values of a quantizer is countable, any quantizer can be decomposed into two distinct stages, which can be referred to as the classification stage (or forward quantization stage) and the reconstruction stage (or inverse quantization stage), where the classification stage maps the input value to an integer quantization index k and the reconstruction stage maps the index k to the reconstruction value yk that is the output approximation of the input value. For the example uniform quantizer described above, the forward quantization stage can be expressed as

k=⌊xΔ+12⌋,

and the reconstruction stage for this example quantizer is simply

yk=k⋅Δ.

This decomposition is useful for the design and analysis of quantization behavior, and it illustrates how the quantized data can be communicated over a communication channel – a source encoder can perform the forward quantization stage and send the index information through a communication channel, and a decoder can perform the reconstruction stage to produce the output approximation of the original input data. In general, the forward quantization stage may use any function that maps the input data to the integer space of the quantization index data, and the inverse quantization stage can conceptually (or literally) be a table look-up operation to map each quantization index to a corresponding reconstruction value. This two-stage decomposition applies equally well to vector as well as scalar quantizers.

## Mathematical properties

Because quantization is a many-to-few mapping, it is an inherently non-linear and irreversible process (i.e., because the same output value is shared by multiple input values, it is impossible, in general, to recover the exact input value when given only the output value).

The set of possible input values may be infinitely large, and may possibly be continuous and therefore uncountable (such as the set of all real numbers, or all real numbers within some limited range). The set of possible output values may be finite or countably infinite.[6] The input and output sets involved in quantization can be defined in a rather general way. For example, vector quantization is the application of quantization to multi-dimensional (vector-valued) input data.[7]

## Types

2-bit resolution with four levels of quantization compared to analog.[8] 3-bit resolution with eight levels.

### Analog-to-digital converter

An analog-to-digital converter (ADC) can be modeled as two processes: sampling and quantization. Sampling converts a time-varying voltage signal into a discrete-time signal, a sequence of real numbers. Quantization replaces each real number with an approximation from a finite set of discrete values. Most commonly, these discrete values are represented as fixed-point words. Though any number of quantization levels is possible, common word-lengths are 8-bit (256 levels), 16-bit (65,536 levels) and 24-bit (16.8 million levels). Quantizing a sequence of numbers produces a sequence of quantization errors which is sometimes modeled as an additive random signal called quantization noise because of its stochastic behavior. The more levels a quantizer uses, the lower is its quantization noise power.

### Rate–distortion optimization

Rate–distortion optimized quantization is encountered in source coding for lossy data compression algorithms, where the purpose is to manage distortion within the limits of the bit rate supported by a communication channel or storage medium. The analysis of quantization in this context involves studying the amount of data (typically measured in digits or bits or bit rate) that is used to represent the output of the quantizer, and studying the loss of precision that is introduced by the quantization process (which is referred to as the distortion).

### Mid-riser and mid-tread uniform quantizers

Most uniform quantizers for signed input data can be classified as being of one of two types: mid-riser and mid-tread. The terminology is based on what happens in the region around the value 0, and uses the analogy of viewing the input-output function of the quantizer as a stairway. Mid-tread quantizers have a zero-valued reconstruction level (corresponding to a tread of a stairway), while mid-riser quantizers have a zero-valued classification threshold (corresponding to a riser of a stairway).[9]

Mid-tread quantization involves rounding. The formulas for mid-tread uniform quantization are provided in the previous section.

Mid-riser quantization involves truncation. The input-output formula for a mid-riser uniform quantizer is given by:

Q(x)=Δ⋅(⌊xΔ⌋+12),

where the classification rule is given by

k=⌊xΔ⌋

and the reconstruction rule is

yk=Δ⋅(k+12).

Note that mid-riser uniform quantizers do not have a zero output value – their minimum output magnitude is half the step size. In contrast, mid-tread quantizers do have a zero output level. For some applications, having a zero output signal representation may be a necessity.

In general, a mid-riser or mid-tread quantizer may not actually be a uniform quantizer – i.e., the size of the quantizer's classification intervals may not all be the same, or the spacing between its possible output values may not all be the same. The distinguishing characteristic of a mid-riser quantizer is that it has a classification threshold value that is exactly zero, and the distinguishing characteristic of a mid-tread quantizer is that is it has a reconstruction value that is exactly zero.[9]

### Dead-zone quantizers

A dead-zone quantizer is a type of mid-tread quantizer with symmetric behavior around 0. The region around the zero output value of such a quantizer is referred to as the dead zone or deadband. The dead zone can sometimes serve the same purpose as a noise gate or squelch function. Especially for compression applications, the dead-zone may be given a different width than that for the other steps. For an otherwise-uniform quantizer, the dead-zone width can be set to any value w by using the forward quantization rule[10][11][12]

k=sgn⁡(x)⋅max⁡(0,⌊|x|−w/2Δ+1⌋),

where the function sgn( ) is the sign function (also known as the signum function). The general reconstruction rule for such a dead-zone quantizer is given by

yk=sgn⁡(k)⋅(w2+Δ⋅(|k|−1+rk)),

where rk is a reconstruction offset value in the range of 0 to 1 as a fraction of the step size. Ordinarily, 0≤rk≤12 when quantizing input data with a typical probability density function (PDF) that is symmetric around zero and reaches its peak value at zero (such as a Gaussian, Laplacian, or generalized Gaussian PDF). Although rk may depend on k in general, and can be chosen to fulfill the optimality condition described below, it is often simply set to a constant, such as 12. (Note that in this definition, y0=0 due to the definition of the sgn( ) function, so r0 has no effect.)

A very commonly used special case (e.g., the scheme typically used in financial accounting and elementary mathematics) is to set w=Δ and rk=12 for all k. In this case, the dead-zone quantizer is also a uniform quantizer, since the central dead-zone of this quantizer has the same width as all of its other steps, and all of its reconstruction values are equally spaced as well.

## Noise and error characteristics

### Additive noise model

A common assumption for the analysis of quantization error is that it affects a signal processing system in a similar manner to that of additive white noise – having negligible correlation with the signal and an approximately flat power spectral density.[2][6][13][14] The additive noise model is commonly used for the analysis of quantization error effects in digital filtering systems, and it can be very useful in such analysis. It has been shown to be a valid model in cases of high resolution quantization (small Δ relative to the signal strength) with smooth PDFs.[2][15]

Additive noise behavior is not always a valid assumption. Quantization error (for quantizers defined as described here) is deterministically related to the signal and not entirely independent of it. Thus, periodic signals can create periodic quantization noise. And in some cases it can even cause limit cycles to appear in digital signal processing systems. One way to ensure effective independence of the quantization error from the source signal is to perform dithered quantization (sometimes with noise shaping), which involves adding random (or pseudo-random) noise to the signal prior to quantization.[6][14]

### Quantization error models

In the typical case, the original signal is much larger than one least significant bit (LSB). When this is the case, the quantization error is not significantly correlated with the signal, and has an approximately uniform distribution. When rounding is used to quantize, the quantization error has a mean of zero and the root mean square (RMS) value is the standard deviation of this distribution, given by 112LSB ≈ 0.289LSB. When truncation is used, the error has a non-zero mean of 12LSB and the RMS value is 13LSB. Although rounding yields less RMS error than truncation, the difference is only due to the static (DC) term of 12LSB. The RMS values of the AC error are exactly the same in both cases, so there is no special advantage of rounding over truncation in situations where the DC term of the error can be ignored (such as in AC coupled systems). In either case, the standard deviation, as a percentage of the full signal range, changes by a factor of 2 for each 1-bit change in the number of quantization bits. The potential signal-to-quantization-noise power ratio therefore changes by 4, or 10⋅log10(4), approximately 6 dB per bit.

At lower amplitudes the quantization error becomes dependent on the input signal, resulting in distortion. This distortion is created after the anti-aliasing filter, and if these distortions are above 1/2 the sample rate they will alias back into the band of interest. In order to make the quantization error independent of the input signal, the signal is dithered by adding noise to the signal. This slightly reduces signal to noise ratio, but can completely eliminate the distortion.

### Quantization noise model

Comparison of quantizing a sinusoid to 64 levels (6 bits) and 256 levels (8 bits). The additive noise created by 6-bit quantization is 12 dB greater than the noise created by 8-bit quantization. When the spectral distribution is flat, as in this example, the 12 dB difference manifests as a measurable difference in the noise floors.

Quantization noise is a model of quantization error introduced by quantization in the ADC. It is a rounding error between the analog input voltage to the ADC and the output digitized value. The noise is non-linear and signal-dependent. It can be modelled in several different ways.

In an ideal ADC, where the quantization error is uniformly distributed between −1/2 LSB and +1/2 LSB, and the signal has a uniform distribution covering all quantization levels, the Signal-to-quantization-noise ratio (SQNR) can be calculated from

SQNR=20log10(2Q)≈6.02⋅Q dB

where Q is the number of quantization bits.

The most common test signals that fulfill this are full amplitude triangle waves and sawtooth waves.

For example, a 16-bit ADC has a maximum signal-to-quantization-noise ratio of 6.02 × 16 = 96.3 dB.

When the input signal is a full-amplitude sine wave the distribution of the signal is no longer uniform, and the corresponding equation is instead

SQNR≈1.761+6.02⋅Q dB

Here, the quantization noise is once again assumed to be uniformly distributed. When the input signal has a high amplitude and a wide frequency spectrum this is the case.[16] In this case a 16-bit ADC has a maximum signal-to-noise ratio of 98.09 dB. The 1.761 difference in signal-to-noise only occurs due to the signal being a full-scale sine wave instead of a triangle or sawtooth.

For complex signals in high-resolution ADCs this is an accurate model. For low-resolution ADCs, low-level signals in high-resolution ADCs, and for simple waveforms the quantization noise is not uniformly distributed, making this model inaccurate.[17] In these cases the quantization noise distribution is strongly affected by the exact amplitude of the signal.

The calculations are relative to full-scale input. For smaller signals, the relative quantization distortion can be very large. To circumvent this issue, analog companding can be used, but this can introduce distortion.

## Design

### Granular distortion and overload distortion

Often the design of a quantizer involves supporting only a limited range of possible output values and performing clipping to limit the output to this range whenever the input exceeds the supported range. The error introduced by this clipping is referred to as overload distortion. Within the extreme limits of the supported range, the amount of spacing between the selectable output values of a quantizer is referred to as its granularity, and the error introduced by this spacing is referred to as granular distortion. It is common for the design of a quantizer to involve determining the proper balance between granular distortion and overload distortion. For a given supported number of possible output values, reducing the average granular distortion may involve increasing the average overload distortion, and vice versa. A technique for controlling the amplitude of the signal (or, equivalently, the quantization step size Δ) to achieve the appropriate balance is the use of automatic gain control (AGC). However, in some quantizer designs, the concepts of granular error and overload error may not apply (e.g., for a quantizer with a limited range of input data or with a countably infinite set of selectable output values).[6]

### Rate–distortion quantizer design

A scalar quantizer, which performs a quantization operation, can ordinarily be decomposed into two stages:

Classification
A process that classifies the input signal range into M non-overlapping intervals {Ik}k=1M, by defining M−1 decision boundary values {bk}k=1M−1, such that Ik=[bk−1,bk) for k=1,2,…,M, with the extreme limits defined by b0=−∞ and bM=∞. All the inputs x that fall in a given interval range Ik are associated with the same quantization index k.
Reconstruction
Each interval Ik is represented by a reconstruction value yk which implements the mapping x∈Ik⇒y=yk.

These two stages together comprise the mathematical operation of y=Q(x).

Entropy coding techniques can be applied to communicate the quantization indices from a source encoder that performs the classification stage to a decoder that performs the reconstruction stage. One way to do this is to associate each quantization index k with a binary codeword ck. An important consideration is the number of bits used for each codeword, denoted here by length(ck). As a result, the design of an M-level quantizer and an associated set of codewords for communicating its index values requires finding the values of {bk}k=1M−1, {ck}k=1M and {yk}k=1M which optimally satisfy a selected set of design constraints such as the bit rate R and distortion D.

Assuming that an information source S produces random variables X with an associated PDF f(x), the probability pk that the random variable falls within a particular quantization interval Ik is given by:

pk=P[x∈Ik]=∫bk−1bkf(x)dx.

The resulting bit rate R, in units of average bits per quantized value, for this quantizer can be derived as follows:

R=∑k=1Mpk⋅length(ck)=∑k=1Mlength(ck)∫bk−1bkf(x)dx.

If it is assumed that distortion is measured by mean squared error,[lower-alpha 1] the distortion D, is given by:

D=E[(x−Q(x))2]=∫−∞∞(x−Q(x))2f(x)dx=∑k=1M∫bk−1bk(x−yk)2f(x)dx.

A key observation is that rate R depends on the decision boundaries {bk}k=1M−1 and the codeword lengths {length(ck)}k=1M, whereas the distortion D depends on the decision boundaries {bk}k=1M−1 and the reconstruction levels {yk}k=1M.

After defining these two performance metrics for the quantizer, a typical rate–distortion formulation for a quantizer design problem can be expressed in one of two ways:

1. Given a maximum distortion constraint D≤Dmax, minimize the bit rate R
2. Given a maximum bit rate constraint R≤Rmax, minimize the distortion D

Often the solution to these problems can be equivalently (or approximately) expressed and solved by converting the formulation to the unconstrained problem min⁡{D+λ⋅R} where the Lagrange multiplier λ is a non-negative constant that establishes the appropriate balance between rate and distortion. Solving the unconstrained problem is equivalent to finding a point on the convex hull of the family of solutions to an equivalent constrained formulation of the problem. However, finding a solution – especially a closed-form solution – to any of these three problem formulations can be difficult. Solutions that do not require multi-dimensional iterative optimization techniques have been published for only three PDFs: the uniform,[18] exponential,[12] and Laplacian[12] distributions. Iterative optimization approaches can be used to find solutions in other cases.[6][19][20]

Note that the reconstruction values {yk}k=1M affect only the distortion – they do not affect the bit rate – and that each individual yk makes a separate contribution dk to the total distortion as shown below:

D=∑k=1Mdk

where

dk=∫bk−1bk(x−yk)2f(x)dx

This observation can be used to ease the analysis – given the set of {bk}k=1M−1 values, the value of each yk can be optimized separately to minimize its contribution to the distortion D.

For the mean-square error distortion criterion, it can be easily shown that the optimal set of reconstruction values {yk*}k=1M is given by setting the reconstruction value yk within each interval Ik to the conditional expected value (also referred to as the centroid) within the interval, as given by:

yk*=1pk∫bk−1bkxf(x)dx.

The use of sufficiently well-designed entropy coding techniques can result in the use of a bit rate that is close to the true information content of the indices {k}k=1M, such that effectively

length(ck)≈−log2(pk)

and therefore

R=∑k=1M−pk⋅log2(pk).

The use of this approximation can allow the entropy coding design problem to be separated from the design of the quantizer itself. Modern entropy coding techniques such as arithmetic coding can achieve bit rates that are very close to the true entropy of a source, given a set of known (or adaptively estimated) probabilities {pk}k=1M.

In some designs, rather than optimizing for a particular number of classification regions M, the quantizer design problem may include optimization of the value of M as well. For some probabilistic source models, the best performance may be achieved when M approaches infinity.

### Neglecting the entropy constraint: Lloyd–Max quantization

In the above formulation, if the bit rate constraint is neglected by setting λ equal to 0, or equivalently if it is assumed that a fixed-length code (FLC) will be used to represent the quantized data instead of a variable-length code (or some other entropy coding technology such as arithmetic coding that is better than an FLC in the rate–distortion sense), the optimization problem reduces to minimization of distortion D alone.

The indices produced by an M-level quantizer can be coded using a fixed-length code using R=⌈log2M⌉ bits/symbol. For example, when M=256 levels, the FLC bit rate R is 8 bits/symbol. For this reason, such a quantizer has sometimes been called an 8-bit quantizer. However using an FLC eliminates the compression improvement that can be obtained by use of better entropy coding.

Assuming an FLC with M levels, the rate–distortion minimization problem can be reduced to distortion minimization alone. The reduced problem can be stated as follows: given a source X with PDF f(x) and the constraint that the quantizer must use only M classification regions, find the decision boundaries {bk}k=1M−1 and reconstruction levels {yk}k=1M to minimize the resulting distortion

D=E[(x−Q(x))2]=∫−∞∞(x−Q(x))2f(x)dx=∑k=1M∫bk−1bk(x−yk)2f(x)dx=∑k=1Mdk.

Finding an optimal solution to the above problem results in a quantizer sometimes called a MMSQE (minimum mean-square quantization error) solution, and the resulting PDF-optimized (non-uniform) quantizer is referred to as a Lloyd–Max quantizer, named after two people who independently developed iterative methods[6][21][22] to solve the two sets of simultaneous equations resulting from ∂D/∂bk=0 and ∂D/∂yk=0, as follows:

∂D∂bk=0⇒bk=yk+yk+12,

which places each threshold at the midpoint between each pair of reconstruction values, and

∂D∂yk=0⇒yk=∫bk−1bkxf(x)dx∫bk−1bkf(x)dx=1pk∫bk−1bkxf(x)dx

which places each reconstruction value at the centroid (conditional expected value) of its associated classification interval.

Lloyd's Method I algorithm, originally described in 1957, can be generalized in a straightforward way for application to vector data. This generalization results in the Linde–Buzo–Gray (LBG) or k-means classifier optimization methods. Moreover, the technique can be further generalized in a straightforward way to also include an entropy constraint for vector data.[23]

### Uniform quantization and the 6 dB/bit approximation

The Lloyd–Max quantizer is actually a uniform quantizer when the input PDF is uniformly distributed over the range [y1−Δ/2,yM+Δ/2). However, for a source that does not have a uniform distribution, the minimum-distortion quantizer may not be a uniform quantizer. The analysis of a uniform quantizer applied to a uniformly distributed source can be summarized in what follows:

A symmetric source X can be modelled with f(x)=12Xmax, for x∈[−Xmax,Xmax] and 0 elsewhere. The step size Δ=2XmaxM and the signal to quantization noise ratio (SQNR) of the quantizer is

SQNR=10log10σx2σq2=10log10(MΔ)2/12Δ2/12=10log10M2=20log10M.

For a fixed-length code using N bits, M=2N, resulting in SQNR=20log102N=N⋅(20log102)=N⋅6.0206dB,

or approximately 6 dB per bit. For example, for N=8 bits, M=256 levels and SQNR = 8×6 = 48 dB; and for N=16 bits, M=65536 and SQNR = 16×6 = 96 dB. The property of 6 dB improvement in SQNR for each extra bit used in quantization is a well-known figure of merit. However, it must be used with care: this derivation is only for a uniform quantizer applied to a uniform source. For other source PDFs and other quantizer designs, the SQNR may be somewhat different from that predicted by 6 dB/bit, depending on the type of PDF, the type of source, the type of quantizer, and the bit rate range of operation.

However, it is common to assume that for many sources, the slope of a quantizer SQNR function can be approximated as 6 dB/bit when operating at a sufficiently high bit rate. At asymptotically high bit rates, cutting the step size in half increases the bit rate by approximately 1 bit per sample (because 1 bit is needed to indicate whether the value is in the left or right half of the prior double-sized interval) and reduces the mean squared error by a factor of 4 (i.e., 6 dB) based on the Δ2/12 approximation.

At asymptotically high bit rates, the 6 dB/bit approximation is supported for many source PDFs by rigorous theoretical analysis.[2][3][5][6] Moreover, the structure of the optimal scalar quantizer (in the rate–distortion sense) approaches that of a uniform quantizer under these conditions.[5][6]

## In other fields

Many physical quantities are actually quantized by physical entities. Examples of fields where this limitation applies include electronics (due to electrons), optics (due to photons), biology (due to DNA), physics (due to Planck limits) and chemistry (due to molecules).

## See also

* Beta encoder
* Color quantization
* Data binning
* Discretization
* Discretization error
* Posterization
* Pulse-code modulation
* Quantile
* Quantization (image processing)
* Regression dilution – a bias in parameter estimates caused by errors such as quantization in the explanatory or independent variable

## Notes

1. ↑ Other distortion measures can also be considered, although mean squared error is a popular one.

## References

1. ↑ Sheppard, W. F. (1897). "On the Calculation of the most Probable Values of Frequency-Constants, for Data arranged according to Equidistant Division of a Scale". Proceedings of the London Mathematical Society (Wiley) s1-29 (1): 353–380. doi:10.1112/plms/s1-29.1.353. ISSN 0024-6115. https://zenodo.org/record/1447738.
2. ↑ 2.0 2.1 2.2 2.3 W. R. Bennett, "Spectra of Quantized Signals", Bell System Technical Journal, Vol. 27, pp. 446–472, July 1948.
3. ↑ 3.0 3.1 Oliver, B.M.; Pierce, J.R.; Shannon, C.E. (1948). "The Philosophy of PCM". Proceedings of the IRE (Institute of Electrical and Electronics Engineers (IEEE)) 36 (11): 1324–1331. doi:10.1109/jrproc.1948.231941. ISSN 0096-8390.
4. ↑ Seymour Stein and J. Jay Jones, Modern Communication Principles, McGraw–Hill, ISBN 978-0-07-061003-3, 1967 (p. 196).
5. ↑ 5.0 5.1 5.2 Gish, H.; Pierce, J. (1968). "Asymptotically efficient quantizing". IEEE Transactions on Information Theory (Institute of Electrical and Electronics Engineers (IEEE)) 14 (5): 676–683. doi:10.1109/tit.1968.1054193. ISSN 0018-9448.
6. ↑ 6.0 6.1 6.2 6.3 6.4 6.5 6.6 6.7 6.8 Gray, R.M.; Neuhoff, D.L. (1998). "Quantization". IEEE Transactions on Information Theory (Institute of Electrical and Electronics Engineers (IEEE)) 44 (6): 2325–2383. doi:10.1109/18.720541. ISSN 0018-9448.
7. ↑ Allen Gersho; Robert M. Gray (1991). Vector Quantization and Signal Compression. Springer. ISBN 978-0-7923-9181-4. https://books.google.com/books?id=DwcDm6xgItUC.
8. ↑ Hodgson, Jay (2010). Understanding Records, p.56. ISBN 978-1-4411-5607-5. Adapted from Franz, David (2004). Recording and Producing in the Home Studio, p.38-9. Berklee Press.
9. ↑ 9.0 9.1 Gersho, A. (1977). "Quantization". IEEE Communications Society Magazine (Institute of Electrical and Electronics Engineers (IEEE)) 15 (5): 16–28. doi:10.1109/mcom.1977.1089500. ISSN 0148-9615.
10. ↑ Rabbani, Majid; Joshi, Rajan L.; Jones, Paul W. (2009). "Section 1.2.3: Quantization, in Chapter 1: JPEG 2000 Core Coding System (Part 1)". in Schelkens, Peter; Skodras, Athanassios; Ebrahimi, Touradj. The JPEG 2000 Suite. John Wiley & Sons. pp. 22–24. ISBN 978-0-470-72147-6. https://archive.org/details/jpegsuitethewile00sche.
11. ↑ Taubman, David S.; Marcellin, Michael W. (2002). "Chapter 3: Quantization". JPEG2000: Image Compression Fundamentals, Standards and Practice. Kluwer Academic Publishers. p. 107. ISBN 0-7923-7519-X. https://archive.org/details/jpegimagecompres00taub.
12. ↑ 12.0 12.1 12.2 Sullivan, G.J. (1996). "Efficient scalar quantization of exponential and Laplacian random variables". IEEE Transactions on Information Theory (Institute of Electrical and Electronics Engineers (IEEE)) 42 (5): 1365–1374. doi:10.1109/18.532878. ISSN 0018-9448.
13. ↑ Widrow, B. (1956). "A Study of Rough Amplitude Quantization by Means of Nyquist Sampling Theory". IRE Transactions on Circuit Theory (Institute of Electrical and Electronics Engineers (IEEE)) 3 (4): 266–276. doi:10.1109/tct.1956.1086334. ISSN 0096-2007.
14. ↑ 14.0 14.1 Bernard Widrow, "Statistical analysis of amplitude quantized sampled data systems", Trans. AIEE Pt. II: Appl. Ind., Vol. 79, pp. 555–568, Jan. 1961.
15. ↑ Marco, D.; Neuhoff, D.L. (2005). "The Validity of the Additive Noise Model for Uniform Scalar Quantizers". IEEE Transactions on Information Theory (Institute of Electrical and Electronics Engineers (IEEE)) 51 (5): 1739–1755. doi:10.1109/tit.2005.846397. ISSN 0018-9448.
16. ↑ Pohlman, Ken C. (1989). Principles of Digital Audio 2nd Edition. SAMS. p. 60. ISBN 9780071441568. https://books.google.com/books?id=VZw6z9a03ikC&pg=PA37.
17. ↑ Watkinson, John (2001). The Art of Digital Audio 3rd Edition. Focal Press. ISBN 0-240-51587-0.
18. ↑ Farvardin, N.; Modestino, J. (1984). "Optimum quantizer performance for a class of non-Gaussian memoryless sources". IEEE Transactions on Information Theory (Institute of Electrical and Electronics Engineers (IEEE)) 30 (3): 485–497. doi:10.1109/tit.1984.1056920. ISSN 0018-9448. (Section VI.C and Appendix B)
19. ↑ Berger, T. (1972). "Optimum quantizers and permutation codes". IEEE Transactions on Information Theory (Institute of Electrical and Electronics Engineers (IEEE)) 18 (6): 759–765. doi:10.1109/tit.1972.1054906. ISSN 0018-9448.
20. ↑ Berger, T. (1982). "Minimum entropy quantizers and permutation codes". IEEE Transactions on Information Theory (Institute of Electrical and Electronics Engineers (IEEE)) 28 (2): 149–157. doi:10.1109/tit.1982.1056456. ISSN 0018-9448.
21. ↑ Lloyd, S. (1982). "Least squares quantization in PCM". IEEE Transactions on Information Theory (Institute of Electrical and Electronics Engineers (IEEE)) 28 (2): 129–137. doi:10.1109/tit.1982.1056489. ISSN 0018-9448. (work documented in a manuscript circulated for comments at Bell Laboratories with a department log date of 31 July 1957 and also presented at the 1957 meeting of the Institute of Mathematical Statistics, although not formally published until 1982).
22. ↑ Max, J. (1960). "Quantizing for minimum distortion". IEEE Transactions on Information Theory (Institute of Electrical and Electronics Engineers (IEEE)) 6 (1): 7–12. doi:10.1109/tit.1960.1057548. ISSN 0018-9448.
23. ↑ Chou, P.A.; Lookabaugh, T.; Gray, R.M. (1989). "Entropy-constrained vector quantization". IEEE Transactions on Acoustics, Speech, and Signal Processing (Institute of Electrical and Electronics Engineers (IEEE)) 37 (1): 31–42. doi:10.1109/29.17498. ISSN 0096-3518.

* Sayood, Khalid (2005), Introduction to Data Compression, Third Edition, Morgan Kaufmann, ISBN 978-0-12-620862-7
* Jayant, Nikil S.; Noll, Peter (1984), Digital Coding of Waveforms: Principles and Applications to Speech and Video, Prentice–Hall, ISBN 978-0-13-211913-9
* Gregg, W. David (1977), Analog & Digital Communication, John Wiley, ISBN 978-0-471-32661-8
* Stein, Seymour; Jones, J. Jay (1967), Modern Communication Principles, McGraw–Hill, ISBN 978-0-07-061003-3

## Further reading

* Bernard Widrow; István Kollár (2007). Quantization noise in Digital Computation, Signal Processing, and Control. Cambridge University Press. ISBN 9780521886710. http://www.mit.bme.hu/books/quantization/.

## See also

* Least count

* v
* t
* e

Digital signal processing

Theory|

* Detection theory
* Discrete signal
* Estimation theory
* Nyquist–Shannon sampling theorem

Sub-fields|

* Audio signal processing
* Digital image processing
* Speech processing
* Statistical signal processing

Techniques|

* Advanced Z-transform
* Bilinear transform
* Constant-Q transform
* Discrete cosine transform (DCT)
* Discrete Fourier transform (DFT)
* Discrete-time Fourier transform (DTFT)
* Impulse invariance
* Integral transform
* Laplace transform
* Matched Z-transform method
* Post's inversion formula
* Starred transform
* Z-transform
* Zak transform

Sampling|

* Aliasing
* Anti-aliasing filter
* Downsampling
* Nyquist rate / frequency
* Oversampling
* Quantization
* Sampling rate
* Undersampling
* Upsampling

* v
* t
* e

Data compression methods

Lossless|

| Entropy type|

* Arithmetic
* Asymmetric numeral systems
* Golomb
* Huffman
* Adaptive
* Canonical
* Modified
* Range
* Shannon
* Shannon–Fano
* Shannon–Fano–Elias
* Tunstall
* Unary
* Universal
* Exp-Golomb
* Fibonacci
* Gamma
* Levenshtein

|

Dictionary type|

* Byte pair encoding
* Lempel–Ziv
* Brotli
* DEFLATE
* LZ4
* LZFSE
* LZJB
* LZMA
* LZO
* LZRW
* LZS
* LZSS
* LZW
* LZWL
* LZX
* Snappy
* Zstandard

Other types|

* BWT
* CTW
* Delta
* DMC
* DPCM
* LDCT
* MTF
* PAQ
* PPM
* RLE

Lossy|

| Transform type|

* Discrete cosine transform
* DCT
* MDCT
* DST
* FFT
* Wavelet
* Daubechies
* DWT
* SPIHT

|

Predictive type|

* DPCM
* ADPCM
* LPC
* ACELP
* CELP
* LAR
* LSP
* WLPC
* Motion
* Compensation
* Estimation
* Vector
* Psychoacoustic

Audio|

| Concepts|

* Bit rate
* ABR
* CBR
* VBR
* Companding
* Convolution
* Dynamic range
* Latency
* Nyquist–Shannon theorem
* Sampling
* Sound quality
* Speech coding
* Sub-band coding

|

Codec parts|

* A-law
* μ-law
* DPCM
* ADPCM
* FT
* FFT
* LPC
* ACELP
* CELP
* LAR
* LSP
* WLPC
* MDCT
* Psychoacoustic model

Image|

| Concepts|

* Chroma subsampling
* Coding tree unit
* Color space
* Compression artifact
* Image resolution
* Macroblock
* Pixel
* PSNR
* Quantization
* Standard test image

|

Methods|

* Chain code
* DCT
* DEFLATE
* Fractal
* KLT
* LP
* RLE
* Wavelet
* Daubechies
* DWT
* EZW
* SPIHT

Video|

| Concepts|

* Bit rate
* ABR
* CBR
* VBR
* Display resolution
* Frame
* Frame rate
* Frame types
* Interlace
* Video characteristics
* Video quality

|

Codec parts|

* DCT
* DPCM
* Deblocking filter
* Lapped transform
* Motion
* Compensation
* Estimation
* Vector
* Wavelet
* Daubechies
* DWT

Theory|

* Entropy
* Information theory
* Timeline
* Kolmogorov complexity
* Quantization
* Rate–distortion
* Redundancy

* Compression formats
* Compression software (codecs)

* v
* t
* e

Noise (physics and telecommunications)

General|

* Acoustic quieting
* Distortion
* Noise cancellation
* Noise control
* Noise measurement
* Noise power
* Noise reduction
* Noise temperature
* Phase distortion

Noise in...|

* Audio
* Buildings
* Electronics
* Environment
* Government regulation
* Human health
* Images
* Radio
* Rooms
* Ships
* Sound masking
* Transportation
* Video

Class of noise|

* Additive white Gaussian noise (AWGN)
* Atmospheric noise
* Background noise
* Brownian noise
* Burst noise
* Cosmic noise
* Flicker noise
* Gaussian noise
* Grey noise
* Jitter
* Johnson–Nyquist noise (thermal noise)
* Pink noise
* Quantization error (or q. noise)
* Shot noise
* White noise
* Coherent noise
* Value noise
* Gradient noise
* Worley noise

Engineering
terms|

* Channel noise level
* Circuit noise level
* Effective input noise temperature
* Equivalent noise resistance
* Equivalent pulse code modulation noise
* Impulse noise (audio)
* Noise figure
* Noise floor
* Noise shaping
* Noise spectral density
* Noise, vibration, and harshness (NVH)
* Phase noise
* Pseudorandom noise
* Statistical noise

Ratios|

* Carrier-to-noise ratio (C/N)
* Carrier-to-receiver noise density (C/kT)
* dBrnC
* Eb/N0 (energy per bit to noise density)
* Es/N0 (energy per symbol to noise density)
* Modulation error ratio (MER)
* Signal, noise and distortion (SINAD)
* Signal-to-interference ratio (S/I)
* Signal-to-noise ratio (S/N, SNR)
* Signal-to-noise ratio (imaging)
* Signal to noise plus interference (SNIR)
* Signal-to-quantization-noise ratio (SQNR)
* Contrast-to-noise ratio (CNR)

Related topics|

* List of noise topics
* Acoustics
* Colors of noise
* Interference (communication)
* Noise generator
* Radio noise source
* Spectrum analyzer
* Thermal radiation

Denoise
methods|

| General|

* Low-pass filter
* Median filter
* Total variation denoising
* Wavelet denoising

|

2D (Image)|

* Gaussian blur
* Anisotropic diffusion
* Bilateral filter
* Non-local means
* Block-matching and 3D filtering (BM3D)
* Shrinkage Fields
* Denoising autoencoder (DAE)
* Deep Image Prior

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Quantization (signal processing). Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Quantization_(signal_processing)&oldid=191885"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template