Least and most disjoint root sets for Daubechies wavelets

Carl Taswell · 1999

A new set of wavelet filter families has been added to the systematized collection of Daubechies (1988) wavelets. This new set includes complex and real, orthogonal and biorthogonal, least and most disjoint families defined using constraints derived from the principle of separably disjoint root sets in the complex z-domain. All of the new families are considered to be constraint selected without a search and without any evaluation of filter properties such as time-domain regularity or frequency-domain selectivity. In contrast, the older families in the collection are considered to be search optimized for extremal properties. Some of the new families are demonstrated to be equivalent to some of the older families, thereby obviating the necessity for any search in their computation.

Read the paper · More papers on PaperTik