High Order Balanced MultiWavelets: Theory, Factorization and Design

This paper deals with multiwavelets and the different properties of approximation and smoothness that are associated with them. In particular, we focus on the important issue of the preservation of discrete time polynomial signals by multiwavelet based filter banks. We give here a precise definition of balancing for higher degree discrete time polynomial signals and link it to a very natural factorization of the lowpass refinement mask that is the counterpart of the well-known 'zeros at pi' condition on the scaling function in the usual wavelet framework. This property of balancing proves then to be central to the issues of the preservation of smooth signals by the filter bank, the approximation power of the multiresolution analysis and the smoothness of the scaling functions and wavelets. Using these new results, we are able to construct a family of orthogonal multiwavelets with symmetries and compact support that is indexed by the order of balancing. We also give the minimum length orthogonal multiwavelets for any balancing order.


 Record created 2005-07-13, last modified 2018-03-17

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)