Fast approximate Fourier transform via wavelets transform

@inproceedings{Guo1996FastAF,
  title={Fast approximate Fourier transform via wavelets transform},
  author={Haitao Guo and C. Burrus},
  booktitle={Optics & Photonics},
  year={1996}
}
  • Haitao Guo, C. Burrus
  • Published in Optics & Photonics 1996
  • Mathematics, Engineering
  • 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… CONTINUE READING
    13 Citations
    Wavelet transform based fast approximate Fourier transform
    • Haitao Guo, C. Burrus
    • Mathematics, Computer Science
    • 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing
    • 1997
    • 34
    • PDF
    Higher-order spectra computation using wavelet transform
    • Q. Memon
    • Computer Science, Engineering
    • SPIE Defense + Commercial Sensing
    • 2000
    • 1
    Notes on the FFT
    • 7
    A Wavelet-FFT Based Efficient Sparse OFDMA Demodulator and Its Implementation on VLIW Architecture
    A wavelet-like filter based on neuron action potentials for analysis of human scalp electroencephalographs
    • 57
    • PDF
    A Novel Motion Detection Method Using 3D Discrete Wavelet Transform
    • 1
    • PDF
    The Quality-Energy Scalable OFDMA Modulation for Low Power Transmitter and VLIW Processor Based Implementation
    • 3