Scalar Quantization - CS Division - Home标量量化CS分回家.pptVIP

Scalar Quantization CAP5015 Fall 2004 Quantization Definition: Quantization: a process of representing a large – possibly infinite – set of values with a much smaller set. Scalar quantization: a mapping of an input value x into a finite number of output values, y: Q: x ? y One of the simplest and most general idea in lossy compression. Scalar Quantization Many of the fundamental ideas of quantization and compression are easily introduced in the simple context of scalar quantization. An example: any real number x can be rounded off to the nearest integer, say q(x) = round(x) Maps the real line R (a continuous space) into a discrete space. Quantizer The design of the quantizer has a significant impact on the amount of compression obtained and loss incurred in a lossy compression scheme. Quantizer: encoder mapping and decode mapping. Encoder mapping – The encoder divides the range of source into a number of intervals – Each interval is represented by a distinct codeword Decoder mapping – For each received codeword, the decoder generates a reconstruct value Components of a Quantizer Mapping of a 3-bit Encoder Mapping of a 3-bit D/A Converter Components of a Quantizer Digitizing a Sine Wave Step Encoder resulting quantization error (‘noise’) so that Probability Density Function A probability density function f(x) of the random variable x is said to meet the following criterion : Probability associated with a value of x in its domain X is given by Pr( X= x ). The corresponding cumulative distribution function CDF or F(x) requires that F(x) is non-decreasing for x[1] = x[2]. When sampling occurs at discrete intervals then F(x) is said to be monotonically increasing. F(x) is said to be continuous from the right or that the limit of f(x + e) exists when evaluated as e- 0 from the right positive abscissa. In the discrete case the point probabilities of particular values of x[i] have a probability that is alw