Share Email Print

Proceedings Paper

Fast Fourier transform (FFT) based fast architecture and algorithm for discrete wavelet transforms
Author(s): Krishna Aditya; Chee-Hung Henry Chu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 6 April 1995
PDF: 7 pages
Proc. SPIE 2491, Wavelet Applications II, (6 April 1995); doi: 10.1117/12.205461
Show Author Affiliations
Krishna Aditya, Univ. of Southwestern Louisiana (United States)
Chee-Hung Henry Chu, Univ. of Southwestern Louisiana (United States)

Published in SPIE Proceedings Vol. 2491:
Wavelet Applications II
Harold H. Szu, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?