loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'00)
Architecture for Wavelet Packet Transform with Best Tree Searching
Boston, Massachusetts
July 10-July 12
ISBN: 0-7695-0716-6
Maria A. Trenas, University of Malaga
Juan López, University of Malaga
Manuel Sánchez, University of Malaga
Emilio L. Zapata, University of Malaga
Francisco Argüello, University of Santiago
Wavelet Packet Transform (WPT) provides good spectral and temporal resolutions in arbitrary regions of the time-frequency plane. Given an additive cost function, a best-tree searching algorithm allows the selection of the best basis for a given signal according to this function. This adaptive choice of the time-frequency tiling benefits most of the applications where the standard Wavelet Transform (WT) has already shown to be useful. Though much specific architecture have been proposed in the literature for the WT, it is not the case for WPT. In this work, we present a specific architecture for WPT, which implements the best-tree searching algorithm.
Index Terms:
wavelet packets, best tree, architecture
Citation:
Maria A. Trenas, Juan López, Manuel Sánchez, Emilio L. Zapata, Francisco Argüello, "Architecture for Wavelet Packet Transform with Best Tree Searching," asap, pp.289, 12th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.