1 The wavelet transform - International Computer Science Institute
1 The wavelet transform - International Computer Science Institute
1 The wavelet transform - International Computer Science Institute
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
19<br />
Background<br />
amplitudes and - as a trade-off - raises it for larger amplitudes. Since the human ear is much<br />
more sensitive towards the disturbance of soft sounds than towards noise in loud sounds, nonuniform<br />
step sizes between the quantization levels improve the audible quality of the signal.<br />
To quantize telephone speech a 13 bit uniform quantifier (i.e. 8192 reconstruction levels) is<br />
necessary to provide toll quality. Using a logarithmic scheme it is possible to obtain toll quality<br />
speech with a 8 bit logarithmic quantifier.<br />
In the previous methods each sample was quantized independently from its neighbouring samples.<br />
Rate distortion theory tells us that this is not the most efficient method of quantizing the<br />
input data. It is always more efficient to quantize the data in blocks of n samples. <strong>The</strong> process<br />
is simply an extension of the previous scalar quantization methods described above. With scalar<br />
quantization the input sample is treated as a number on the real number-line and is rounded off<br />
to predetermined discrete points. With vector quantization on the other hand, the block of n<br />
samples is treated as a n -dimensional vector and is quantized to predetermined points in the n -<br />
dimensional space.<br />
Vector quantization can always outperform scalar quantization. However, it is more sensitive to<br />
transmission errors and usually involves a much greater computational complexity than scalar<br />
quantization. <strong>The</strong> audio encoding schemes developed by the author use vector quantization.<br />
1.3 Digital filters<br />
A Finite Impulse Response (FIR) filter - which is used in chapter V - produces an output<br />
that is the weighted sum of the current and past inputs .<br />
c i<br />
wn = c0vn – m + … + cm – 1vn<br />
– 1 + cmvn = civn m<br />
<strong>The</strong> weights are called filter coefficients. <strong>The</strong> FIR filter applied to a continuous sampled signal<br />
as depicted in figure 13 results in a filtered signal with attributes that depend on the chosen<br />
filter coefficients.<br />
<strong>The</strong> FIR filter is not the one used for filtering<br />
prior to sampling. This band-limiting is<br />
done earlier by analog filters directly on<br />
the analog signal. <strong>The</strong> frequency response<br />
of a FIR filter determines which frequencies<br />
are kept in the filtered signal and thus<br />
which frequencies are discarded through<br />
filtering. This characteristic is typically<br />
illustrated by a frequency response curve<br />
as in figure 12. <strong>The</strong> normalized frequency<br />
on the x-axis ranges from 0 to 0.5. Multiplied<br />
with the sample rate of the filtered<br />
signal it ranges from the zero frequency to<br />
the Nyquist critical frequency .<br />
f c<br />
Magnitude<br />
A Quadrate Mirror Filter (QMF) is a specially<br />
designed pair of distinctive Finite Impulse Response filters. <strong>The</strong> frequency responses of<br />
the two FIR filters separate the high-frequency and the low-frequency components of the input<br />
1.5<br />
1<br />
0.5<br />
v i<br />
m<br />
∑<br />
i = 0<br />
– + i<br />
FIR−Filter<br />
0<br />
0 0.05 0.1 0.15 0.2 0.25 0.3 0.35 0.4 0.45 0.5<br />
Normalized Frequency<br />
FIGURE 12. the frequency response curve of a Finite<br />
Impulse Respond filter<br />
w n