Integration of the cooley, rader and Winograd-Fourier algorithms for a faster computation of the DFT

  • S. Impedovo
  • T. Simone
  • G. Dimauro
Algorithms And Techniques
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 399)

Abstract

In this paper a new method to make faster the Winograd-Fourier algorithm is presented.

In fact it is shown as for some prime factors the Cooley FFT algorithm together with the Rader algorithm allow a very fast computation of the DFT.

Keywords

Fast Fourier Transform Computer Graphic Prime Factor Prime Number Discrete Fourier Transform 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. W. Cooley, P. A. W. Lewis, P. D. Welch, "The Fast Fourier Transform and its Applications." IEEE Transaction and Education, Vol. 12, no 1, March 1969.Google Scholar
  2. [2]
    S. Winograd, "On Computing the Discrete Fourier Transform". Mathematics of computation, Vol. 32, 1978, pp.175–199.Google Scholar
  3. [3]
    J. H. Mc. Clellan, C.M. Rader, "Number Theory in Digital. Signal Processing". Prentice-Hall Inc., Englewood Cliffs, N.J., 1979.Google Scholar
  4. [4]
    S. Impedovo, "Introduzione all'Analisi Spettrale ed Algoritmi FFT". Adriatica Editrice, Bari, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • S. Impedovo
    • 1
  • T. Simone
    • 1
  • G. Dimauro
    • 1
  1. 1.Istituto di Scienze dell'InformazioneUniversity of BariBariItaly

Personalised recommendations