Quantization (signal processing)

FloorQuantizer.png
In digital signal processing, quantization is the process of approximating a continuous range of values (or a very large set of possible discrete values) by a relativelysmall set of discrete symbols or integer values. More specifically, a signal can be multidimensional and quantization need not be applied to all dimensions. A discrete signal need not necessarily be quantized (a pedantic point, but true nonetheless and can be a point of confusion). See ideal sampler.
A common use of quantization is in the conversion of a discrete signal (a sampled continuous signal) into a digital signal by quantizing. Both of these steps (sampling and quantizing) are performed in analogtodigital converters with the quantization level specified in bits. A specific example would be compact disc (CD) audio which is sampled at 44,100 Hz and quantized with 16 bits (2 bytes) which can be one of 65,536 (<math>2^{16}<math>) possible values per sample.
Contents 
Mathematical description
The simplest and bestknown form of quantization is referred to as scalar quantization, since it operates on scalar (as opposed to multidimensional vector) input data. In general, a scalar quantization operator can be represented as
 <math>Q(x) = g(\lfloor f(x) \rfloor)<math>
where
 <math>x<math> is a real number,
 <math>\lfloor x \rfloor<math> is the floor function, yielding the integer <math>i = \lfloor f(x) \rfloor<math>
 <math>f(x)<math> and <math>g(i)<math> are arbitrary realvalued functions.
The integer value <math>i<math> is the representation that is typically stored or transmitted, and then the final interpretation is constructed using <math>g(i)<math> when the data is later interpreted. The integer value <math>i<math> is sometimes referred to as the quantization index.
In computer audio and most other applications, a method known as uniform quantization is the most common. If <math>x<math> is a realvalued number between 1 and 1, a uniform quantization operator that uses M bits of precision to represent each quantization index can be expressed as
 <math>Q(x) = \frac{\left\lfloor 2^{M1}x \right\rfloor}{2^{M1}}<math>.
In this case the <math>f(x)<math> and <math>g(i)<math> operators are just multiplying scale factors (one multiplier being the inverse of the other). The value <math>2^{(M1)}<math> is often referred to as the quantization step size. Using this quantization law and assuming that quantization noise is approximately uniformly distributed over the quantization step size (an assumption typically accurate for rapidly varying <math>x<math> or high <math>M<math>) and assuming that the input signal <math>x<math> to be quantized is approximately uniformly distributed over the entire interval from 1 to 1, the signal to noise ratio (SNR) of the quantization can be computed as
 <math>
\frac{S}{N_q} \approx 20 \log_{10}(2^M) = 6.0206 M \ \operatorname{dB}<math>.
From this equation, it is often said that the SNR is approximately 6 dB per bit.
In digital telephony, two popular quantization schemes are the 'Alaw' (dominant in Europe) and 'μlaw' (dominant in North America and Japan). These schemes map discrete analog values to an 8bit scale that is nearly linear for small values and then increases logarithmically as amplitude grows. Because the human ear's perception of loudness is roughly logarithmic, this provides a higher signal to noise ratio over the range of audible sound intensities for a given number of bits.
Quantization and data compression
Quantization plays a major part in lossy data compression. In many cases, quantization can be viewed as the fundamental element that distinguishes lossy data compression from lossless data compression, and the use of quantization is nearly always motivated by the need to reduce the amount of data needed to represent a signal. In some compression schemes, like MP3 or Vorbis, compression is also achieved by selectively discarding some data, an action that can be analyzed as a quantization process (e.g., a vector quantization process) or can be considered a different kind of lossy process.
One example of a lossy compression scheme that uses quantization is JPEG image compression. During JPEG encoding, the data representing an image (typically 8bits for each of three color components per pixel) is processed using a discrete cosine transform and is then quantized and entropy coded. By reducing the precision of the transformed values using quantization, the number of bits needed to represent the image can be reduced substantially. For example, images can often be represented with acceptable quality using JPEG at less than 3 bits per pixel (as opposed to the typical 24 bits per pixel needed prior to JPEG compression). Even the original representation using 24 bits per pixel requires quantization for its PCM sampling structure.
In modern compression technology, the entropy of the output of a quantizer matters more than the number of possible values of its output (the number of values being <math>2^M<math> in the above example).
Relation to quantization in nature
At the most fundamental level, all physical quantities are quantized. This is a result of quantum mechanics (see Quantization (physics)). Signals may be treated as continuous for mathematical simplicity by considering the small quantizations as negligible.
In any practical application, this inherent quantization is irrelevant. First of all, it is overshadowed by signal noise, the intrusion of extraneous phenomena present in the system upon the signal of interest. The second, which appears only in measurement applications, is the inaccuracy of instruments.
Related topics
 Analogtodigital converter, Digitaltoanalog converter
 Discrete, Digital
 Dither
 Information theory
 Rate distortion theory
 Vector quantization
External links
 Paper on mathematical theory and analysis of quantization (http://www.math.ucdavis.edu/~saito/courses/ACHA/44it06gray.pdf)da:Kvantisering