DocumentCode
336160
Title
Least and most disjoint root sets for Daubechies wavelets
Author
Taswell, Carl
Author_Institution
Comput.. Toolsmiths, Stanford, CA, USA
Volume
3
fYear
1999
fDate
15-19 Mar 1999
Firstpage
1217
Abstract
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
Keywords
circuit optimisation; filtering theory; wavelet transforms; Daubechies wavelets; biorthogonal wavelet filter; complex wavelet filter; complex z-domain; filter properties; frequency-domain selectivity; least disjoint root set; most disjoint root set; orthogonal wavelet filter; real wavelet filter; search optimized filter; separably disjoint root sets; time-domain regularity; wavelet filter families; Algorithm design and analysis; Constraint optimization; Displays; Economics; Filters; Length measurement; Libraries; Polynomials; Time domain analysis; Time measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1999. Proceedings., 1999 IEEE International Conference on
Conference_Location
Phoenix, AZ
ISSN
1520-6149
Print_ISBN
0-7803-5041-3
Type
conf
DOI
10.1109/ICASSP.1999.756197
Filename
756197
Link To Document