A new inverse discrete wavelet packet transform architecture
2003
In this paper we present a new architecture and its scheduling algorithm for the 1-D inverse discrete wavelet packet transform. The proposed architecture is based on the classical recursive pyramid algorithm (RPA). We use two different RPA-modified blocks to compute three complete levels. We make use of folding and retiming techniques to improve the area and speed-rate. Two different implementations using lifting transformation and polyphase decomposition for the CDF2.2 biorthogonal wavelet coefficients are discussed. The lifting implementation requires approximately 45% less hardware resources than the polyphase structure. Finally, internal pipelining delays minimize the logic depth to one adder.
Keywords:
- Lifting scheme
- Discrete wavelet transform
- Wavelet transform
- Stationary wavelet transform
- Biorthogonal wavelet
- Second-generation wavelet transform
- Mathematical optimization
- Wavelet packet decomposition
- Cascade algorithm
- Theoretical computer science
- Computer science
- Artificial intelligence
- Algorithm
- Pattern recognition
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
5
References
6
Citations
NaN
KQI