<< Chapter < Page Chapter >> Page >

Theorems [link] , [link] , and [link] show that h ( n ) has the characteristics of a lowpass FIR digital filter. We will later see that the FIR filter made up of the wavelet coefficients is ahigh pass filter and the filter bank view developed in  Chapter: Filter Banks and the Discrete Wavelet Transform and Section: Multiplicity-M (M-Band) Scaling Functions and Wavelets further explains this view.

Theorem 16 If h ( n ) has finite support and if φ ( t ) L 1 , then φ ( t ) has finite support [link] .

If φ ( t ) is not restricted to L 1 , it may have infinite support even if h ( n ) has finite support.

These theorems give a good picture of the relationship between the recursive equation coefficients h ( n ) and the scaling function φ ( t ) as a solution of [link] . More properties and characteristics are presented in [link] .

Wavelet system design

One of the main purposes for presenting the rather theoretical results of this chapter is to set up the conditions for designing wavelet systems.One approach is to require the minimum sufficient conditions as constraints in an optimization or approximation,then use the remaining degrees of freedom to choose h ( n ) that will give the best signalrepresentation, decomposition, or compression. In some cases, the sufficient conditions are overly restrictive and it is worthwhile to usethe necessary conditions and then check the design to see if it is satisfactory. In many cases, wavelet systems are designed by a frequencydomain design of H ( ω ) using digital filter design techniques with wavelet based constraints.

The wavelet

Although this chapter is primarily about the scaling function, some basic wavelet properties are included here.

Theorem 17 If the scaling coefficients h ( n ) satisfy the conditions for existence and orthogonality of the scaling function and the wavelet is defined by [link] , then the integer translates of this wavelet span W 0 , the orthogonal compliment of V 0 , both being in V 1 , i.e., the wavelet is orthogonal to the scaling function at the samescale,

φ ( t - n ) ψ ( t - m ) d t = 0 ,

if and only if the coefficients h 1 ( n ) are given by

h 1 ( n ) = ± ( - 1 ) n h ( N - n )

where N is an arbitrary odd integer chosen to conveniently position h 1 ( n ) .

An outline proof is in Appendix A.

Theorem 18 If the scaling coefficients h ( n ) satisfy the conditions for existence and orthogonality of the scaling function and the wavelet is defined by [link] , then the integer translates of this wavelet span W 0 , the orthogonal compliment of V 0 , both being in V 1 ; i.e., the wavelet is orthogonal to the scaling function at the samescale. If

φ ( t - n ) ψ ( t - m ) d t = 0

then

n h ( n ) h 1 ( n - 2 k ) = 0

which is derived in Appendix A, [link] .

The translation orthogonality and scaling function-wavelet orthogonality conditions in [link] and [link] can be combined to give

n h ( n ) h m ( n - 2 k ) = δ ( k ) δ ( - m )

if h 0 ( n ) is defined as h ( n ) .

Theorem 19 If h ( n ) satisfies the linear and quadratic admissibility conditions of [link] and [link] , then

n h 1 ( n ) = H 1 ( 0 ) = 0 ,
| H 1 ( ω ) | = | H ( ω + π ) | ,
| H ( ω ) | 2 + | H 1 ( ω ) | 2 = 2 ,

and

ψ ( t ) d t = 0 .

The wavelet is usually scaled so that its norm is unity.

The results in this section have not included the effects of integer shifts of the scaling function or wavelet coefficients h ( n ) or h 1 ( n ) . In a particular situation, these sequences may be shifted to make thecorresponding FIR filter causal.

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Wavelets and wavelet transforms. OpenStax CNX. Aug 06, 2015 Download for free at https://legacy.cnx.org/content/col11454/1.6
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Wavelets and wavelet transforms' conversation and receive update notifications?

Ask