DWT AND DISCRETE WAVELET PACKET TRANSFORM (DWPT)
215
↓
2
↓
2
=
y
=
Qx
=
y
lp
xy
hp
Q
Q
y
lp
y
hp
x
H
lp
(
z
)
H
hp
(
z
)
Figure 8.2.
Filter-bank interpretation of the DWT.
A detailed discussion of specific technical conditions associated with thevarious wavelet families is beyond the scope of this book, and this chaptertherefore concentrates upon high-level coder architectures. In-depth treatmentof wavelets is available from many sources, e.g., [Daub92]. Before describingthe wavelet-based coders, however, it is useful to summarize some basic waveletcharacteristics. Wavelets are a family of basis functions for the space of squareintegrable signals. A finite energy signal can be represented as a weighted sumof the translates and dilates of a single wavelet. Continuous-time wavelet sig-nal analysis can be extended to discrete-time and square summable sequences.Under certain assumptions, the DWT acts as an orthonormal linear transform
T
:
R
N
→
R
N
. For a compact (finite) support wavelet of length
K
, the asso-ciated transformation matrix,
Q
, is fully determined by a set of coefficients
{
c
k
}
for 0
k
K
−
1. As shown in Figure 8.2, this transformation matrixhas an associated filter-bank interpretation. One application of the transformmatrix,
Q
, to an
N
×
1 signal vector,
x
, generates an
N
×
1 vector of wavelet-domain transform coefficients,
y
. The
N
×
1 vector
y
can be separated into two
N
2
×
1 vectors of approximation and detail coefficients,
y
lp
and
y
hp
, respec-tively. The spectral content of the signal
x
captured in
y
lp
and
y
hp
correspondsto the frequency subbands realized in the 2:1 decimated output sequences froma QMF bank (Section 6.4), which obeys the “power complimentary condition”,i.e.,
|
H
lp
()
|
2
+|
H
lp
(
+
π)
|
2
=
1
, (
8
.
1
)
where
H
lp
()
is the frequency response of the lowpass filter. Therefore, recursiveDWT applications effectively pass input data through a tree-structured cascadeof lowpass (LP) and highpass (HP) filters followed by 2:1 decimation at everynode. The forward/inverse transform matrices of a particular wavelet are associ-ated with a corresponding QMF analysis/synthesis filter bank. The usual waveletdecomposition implements an octave-band filter bank structure as shown inFigure 8.3. In the figure, frequency subbands associated with the coefficientsfrom each stage are schematically represented for an audio signal sampled at44.1 kHz.Wavelet packet (WP) or discrete wavelet packet transform (DWPT) representa-tions, on the other hand, decompose both the detail and approximation coefficientsat each stage of the tree, as shown in Figure 8.4. In the figure, frequency subbands
Add a Comment