Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Fast Fourier transforms: A tutorial review and a state of the art
 
research article

Fast Fourier transforms: A tutorial review and a state of the art

Duhamel, Pierre
•
Vetterli, Martin  
1990
Signal Processing

The publication of the Cooley-Tukey fast Fourier transform (FIT) algorithm in 1965 has opened a new area in digital signal processing by reducing the order of complexity of some crucial computational tasks like Fourier transform and convolution from $N^2$ to $N\log_2 N$, where $N$ is the problem size. The development of the major algorithms (Cooley-Tukey and split-radix FFT, prime factor algorithm and Winograd fast Fourier transform) is reviewed. Then, an attempt is made to indicate the state of the art on the subject, showing the standing of research, open problems and implementations.

  • Files
  • Details
  • Metrics
Type
research article
DOI
10.1016/0165-1684(90)90158-U
Author(s)
Duhamel, Pierre
Vetterli, Martin  
Date Issued

1990

Publisher

Elsevier

Published in
Signal Processing
Volume

19

Issue

4

Start page

259

End page

299

Subjects

Fourier transforms

•

computational complexity

•

fast algorithms

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
LCAV  
Available on Infoscience
November 14, 2005
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/219949
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés