Architecture for Wavelet Packet Transform with Best Tree Searching
ASAP '00 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors
Constrained Wavelet Packets for Tree-Structured Video Coding Algorithms
DCC '99 Proceedings of the Conference on Data Compression
Wavelet packet transforms for system-on-chip applications
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06
IEEE Transactions on Signal Processing
Wavelet packet image coding using space-frequency quantization
IEEE Transactions on Image Processing
Multiplierless modules for forward and backward integer wavelet transform
CompSysTech '03 Proceedings of the 4th international conference conference on Computer systems and technologies: e-Learning
Journal of VLSI Signal Processing Systems
Hi-index | 0.00 |
The standard Wavelet Transform (WT) has a wide range of applications, from signal analysis to image or video compression and communications. Most of these applications would be benefited if the transform provided good spectral and temporal resolution in arbitrary regions of the time-frequency plane. This flexible choice of the time-frequency tiling is provided by the Wavelet Packet Transform (WPT). Though many VLSI architectures have been proposed for the WT in the literature, it is not the case for the WPT. We present both word-serial and word-parallel real-time pipelined architectures capable of computing a complete WPT binary tree, but which are easily configurable to compute any required WPT subtree.