Translator Disclaimer
6 April 1995 Fast Fourier transform (FFT) based fast architecture and algorithm for discrete wavelet transforms
Author Affiliations +
Abstract
We are presenting a fast Fourier transform (FFT) based architecture for computing discrete wavelet transform (DWT) of a one dimensional sequence. The scheme is non recursive unlike a dyadic decomposition and DWT coefficients at all resolutions can be generated simultaneously without waiting for generation of coefficients at a lower octave level. This architecture is faster than time domain convolution based architectures proposed for DWT decomposition and can be fully pipelined. Complexity of control circuits for this architecture is much lower as compared to time domain convolution based architectures. Also problems associated with maintaining streams of intermediate results is eliminated or very much reduced. The speed advantage comes by using FFT based frequency domain convolutions and is more pronounced for long filters. But this comes at the price of increased hardware requirements.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Krishna Aditya and Chee-Hung Henry Chu "Fast Fourier transform (FFT) based fast architecture and algorithm for discrete wavelet transforms", Proc. SPIE 2491, Wavelet Applications II, (6 April 1995); https://doi.org/10.1117/12.205461
PROCEEDINGS
7 PAGES


SHARE
Advertisement
Advertisement
Back to Top