<< Chapter < Page Chapter >> Page >

This theorem shows that, unlike linear constant coefficient differential equations, not just any set of coefficients will support a solution. Thecoefficients must satisfy the linear equation [link] . This is the weakest condition on the h ( n ) .

Theorem 2 If φ ( t ) is an L 1 solution to the basic recursion equation [link] with φ ( t ) d t = 1 , and

φ ( t - ) = φ ( ) = 1

with Φ ( π + 2 π k ) 0 for some k , then

n h ( 2 n ) = n h ( 2 n + 1 )

where [link] may have to be a distributional sum. Conversely, if [link] is satisfied, then [link] is true.

Equation [link] is called the fundamental condition , and it is weaker than requiring orthogonality but stronger than [link] . It is simply a result of requiring the equations resulting from evaluating [link] on the integers be consistent. Equation [link] is called a partitioning of unity (or the Strang condition or the Shoenbergcondition).

A similar theorem by Cavaretta, Dahman and Micchelli [link] and by Jia [link] states that if φ L p and the integer translates of φ ( t ) form a Riesz basis for the space they span, then n h ( 2 n ) = n h ( 2 n + 1 ) .

Theorem 3 If φ ( t ) is an L 2 L 1 solution to [link] and if integer translates of φ ( t ) are orthogonal as defined by

φ ( t ) φ ( t - k ) d t = E δ ( k ) = E if k = 0 0 otherwise,

then

n h ( n ) h ( n - 2 k ) = δ ( k ) = 1 if k = 0 0 otherwise,

Notice that this does not depend on a particular normalization of φ ( t ) .

If φ ( t ) is normalized by dividing by the square root of its energy E , then integer translates of φ ( t ) are orthonormal defined by

φ ( t ) φ ( t - k ) d t = δ ( k ) = 1 if k = 0 0 otherwise,

This theorem shows that in order for the solutions of [link] to be orthogonal under integer translation, it is necessary that thecoefficients of the recursive equation be orthogonal themselves after decimating or downsampling by two. If φ ( t ) and/or h ( n ) are complex functions, complex conjugation must be used in [link] , [link] , and [link] .

Coefficients h ( n ) that satisfy [link] are called a quadrature mirror filter (QMF) or conjugate mirror filter (CMF), and the condition [link] is called the quadratic condition for obvious reasons.

Corollary 1 Under the assumptions of Theorem  [link] , the norm of h ( n ) is automatically unity.

n | h ( n ) | 2 = 1

Not only must the sum of h ( n ) equal 2 , but for orthogonality of the solution, the sum of the squares of h ( n ) must be one, both independent of any normalization of φ ( t ) . This unity normalization of h ( n ) is the result of the 2 term in [link] .

Corollary 2 Under the assumptions of Theorem  [link] ,

n h ( 2 n ) = n h ( 2 n + 1 ) = 1 2

This result is derived in the Appendix by showing that not only must the sum of h ( n ) equal 2 , but for orthogonality of the solution, the individual sums of the even and odd terms in h ( n ) must be 1 / 2 , independent of any normalization of φ ( t ) . Although stated here as necessary for orthogonality, the results hold under weaker non-orthogonalconditions as is stated in Theorem  [link] .

Theorem 4 If φ ( t ) has compact support on 0 t N - 1 and if φ ( t - k ) are linearly independent, then h ( n ) also has compact support over 0 n N - 1 :

h ( n ) = 0 for n < 0 and n > N - 1

Thus N is the length of the h ( n ) sequence.

If the translates are not independent (or some equivalent restriction), one can have h ( n ) with infinite support while φ ( t ) has finite support [link] .

These theorems state that if φ ( t ) has compact support and is orthogonal over integer translates, N 2 bilinear or quadratic equations [link] must be satisfied in addition to the one linear equation [link] . The support or length of h ( n ) is N , which must be an even number. The number of degrees of freedom in choosing these N coefficients is then N 2 - 1 . This freedom will be used in the design of a wavelet system developed in  Chapter: Regularity, Moments, and Wavelet System Design and elsewhere.

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