<< 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 .
Theorem 2 If is an solution to the basic recursion equation [link] with , and
with for some , then
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 and the integer translates of form a Riesz basis for the space they span, then .
Theorem 3 If is an solution to [link] and if integer translates of are orthogonal as defined by
then
Notice that this does not depend on a particular normalization of .
If is normalized by dividing by the square root of its energy , then integer translates of are orthonormal defined by
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 and/or are complex functions, complex conjugation must be used in [link] , [link] , and [link] .
Coefficients 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 is automatically unity.
Not only must the sum of equal , but for orthogonality of the solution, the sum of the squares of must be one, both independent of any normalization of . This unity normalization of is the result of the term in [link] .
Corollary 2 Under the assumptions of Theorem [link] ,
This result is derived in the Appendix by showing that not only must the sum of equal , but for orthogonality of the solution, the individual sums of the even and odd terms in must be , independent of any normalization of . Although stated here as necessary for orthogonality, the results hold under weaker non-orthogonalconditions as is stated in Theorem [link] .
Theorem 4 If has compact support on and if are linearly independent, then also has compact support over :
Thus is the length of the sequence.
If the translates are not independent (or some equivalent restriction), one can have with infinite support while has finite support [link] .
These theorems state that if has compact support and is orthogonal over integer translates, bilinear or quadratic equations [link] must be satisfied in addition to the one linear equation [link] . The support or length of is , which must be an even number. The number of degrees of freedom in choosing these coefficients is then . This freedom will be used in the design of a wavelet system developed in Chapter: Regularity, Moments, and Wavelet System Design and elsewhere.
Notification Switch
Would you like to follow the 'Wavelets and wavelet transforms' conversation and receive update notifications?