<< Chapter < Page Chapter >> Page >
k φ ( t - k ) = 1

holds.

This condition, called the fundamental condition [link] , [link] , gives a slightly tighter result than Theorem  [link] . While the scaling function still may be a distribution not in L 1 or L 2 , it is better behaved than required by Theorem  [link] in being defined on the dense set of dyadic rationals. This theorem is equivalent to requiring H ( π ) = 0 which from the product formula [link] gives a better behaved Φ ( ω ) . It also guarantees a unity eigenvalue for M and T but not that other eigenvalues do not exist with magnitudes larger than one.

The next several theorems use the transition matrix T defined in [link] which is a down-sampled autocorrelation matrix.

Theorem 11 If the transition matrix T has eigenvalues on or in the unit circle of the complex plane and if any on the unit circle are multiple, they have acomplete set of eigenvectors, then φ ( t ) L 2 .

If T has unity magnitude eigenvalues, the successive approximation algorithm (cascade algorithm) [link] converges weakly to φ ( t ) L 2 [link] .

Theorem 12 If the transition matrix T has a simple unity eigenvalue with all other eigenvalues having magnitude less than one, then φ ( t ) L 2 .

Here the successive approximation algorithm (cascade algorithm) converges strongly to φ ( t ) L 2 . This is developed in [link] .

If in addition to requiring [link] , we require the quadratic coefficient conditions [link] , a tighter result occurs which gives φ ( t ) L 2 ( R ) and a multiresolution tight frame system.

Theorem 13 (Lawton) If h ( n ) has finite support or decays fast enough and if n h ( n ) = 2 and if n h ( n ) h ( n - 2 k ) = δ ( k ) , then φ ( t ) L 2 ( R ) exists, and generates a wavelet system that is a tight frame in L 2 .

This important result from Lawton [link] , [link] gives the sufficient conditions for φ ( t ) to exist and generate wavelet tight frames. The proof uses an iteration of the basic recursion equation [link] as a successive approximation similar to Picard's method for differential equations. Indeed, this method is used to calculate φ ( t ) in [link] . It is interesting to note that the scaling function may be very rough, even “fractal" in nature. This maybe desirable if the signal being analyzed is also rough.

Although this theorem guarantees that φ ( t ) generates a tight frame, in most practicalsituations, the resulting system is an orthonormal basis [link] . The conditions in the following theorems are generally satisfied.

Theorem 14 (Lawton) If h(n) has compact support, n h ( n ) = 2 , and n h ( n ) h ( n - 2 k ) = δ ( k ) , then φ ( t - k ) forms an orthogonal set if and only if the transition matrix T has a simple unity eigenvalue.

This powerful result allows a simple evaluation of h ( n ) to see if it can support a wavelet expansion system [link] , [link] , [link] . An equivalent result using the frequency response of the FIR digitalfilter formed from h ( n ) was given by Cohen.

Theorem 15 (Cohen) If H ( ω ) is the DTFT of h ( n ) with compact support and n h ( n ) = 2 with n h ( n ) h ( n - 2 k ) = δ ( k ) ,and if H ( ω ) 0 for - π / 3 ω π / 3 , then the φ ( t - k ) satisfying [link] generate an orthonormal basis in L 2 .

A slightly weaker version of this frequency domain sufficient condition is easier to prove [link] , [link] and to extend to the M-band case for the case of no zerosallowed in - π / 2 ω π / 2 [link] . There are other sufficient conditions that, together with those in Theorem [link] , will guarantee an orthonormal basis. Daubechies' vanishing moments will guaranteean orthogonal basis.

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