Full Content is available to subscribers

Subscribe/Learn More  >
Proceedings Article

Fast approximate Fourier transform via wavelets transform

[+] Author Affiliations
Haitao Guo, C. Sidney Burrus

Rice Univ. (USA)

Proc. SPIE 2825, Wavelet Applications in Signal and Image Processing IV, 250 (October 23, 1996); doi:10.1117/12.255236
Text Size: A A A
From Conference Volume 2825

  • Wavelet Applications in Signal and Image Processing IV
  • Michael A. Unser; Akram Aldroubi; Andrew F. Laine
  • Denver, CO | August 04, 1996

abstract

We propose an algorithm that uses the discrete wavelet transform as a tool to compute the discrete Fourier transform (DFT). The Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. If no intermediate coefficients are dropped and no approximations are made, the proposed algorithm computes the exact results, and its computational complexity is on the same order of the FFT. The main advantage of the proposed algorithm is that the good time and frequency localization of wavelets can be exploited to approximate the Fourier transform for many classes of signals resulting in much less computation. Thus the new algorithm provides an efficient complexity vs accuracy tradeoff. When approximations are allowed, under certain sparsity conditions, the algorithm can achieve linear complexity. It has been shown that the thresholding of the wavelet coefficients has near optimal noise reduction property for many classes of signals. We show that for the same reason, the proposed algorithm also reduces the noise while doing the approximation. If we need to compute the DFT of noisy signals, the proposed algorithm not only can reduce the numerical complexity, but also can produce cleaner results. In summary, we propose a novel fast approximate Fourier transform algorithm using the wavelet transform. Since wavelets are the conditional basis of many classes of signals, the algorithm is very efficient and has built-in de-noising capacity.

© (1996) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
Citation

Haitao Guo and C. Sidney Burrus
"Fast approximate Fourier transform via wavelets transform", Proc. SPIE 2825, Wavelet Applications in Signal and Image Processing IV, 250 (October 23, 1996); doi:10.1117/12.255236; http://dx.doi.org/10.1117/12.255236


Access This Proceeding
Sign in or Create a personal account to Buy this proceeding ($15 for members, $18 for non-members).

Figures

Tables

NOTE:
Citing articles are presented as examples only. In non-demo SCM6 implementation, integration with CrossRef’s "Cited By" API will populate this tab (http://www.crossref.org/citedby.html).

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging & repositioning the boxes below.

Related Book Chapters

Topic Collections

Advertisement
  • Don't have an account?
  • Subscribe to the SPIE Digital Library
  • Create a FREE account to sign up for Digital Library content alerts and gain access to institutional subscriptions remotely.
Access This Proceeding
Sign in or Create a personal account to Buy this proceeding ($15 for members, $18 for non-members).
Access This Proceeding
Sign in or Create a personal account to Buy this article ($15 for members, $18 for non-members).
Access This Chapter

Access to SPIE eBooks is limited to subscribing institutions and is not available as part of a personal subscription. Print or electronic versions of individual SPIE books may be purchased via SPIE.org.