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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
S. Winograd, "On Computing the Discrete Fourier Transform". Mathematics of computation, Vol. 32, 1978, pp.175–199.
J. H. Mc. Clellan, C.M. Rader, "Number Theory in Digital. Signal Processing". Prentice-Hall Inc., Englewood Cliffs, N.J., 1979.
S. Impedovo, "Introduzione all'Analisi Spettrale ed Algoritmi FFT". Adriatica Editrice, Bari, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Impedovo, S., Simone, T., Dimauro, G. (1989). Integration of the cooley, rader and Winograd-Fourier algorithms for a faster computation of the DFT. In: Cantoni, V., Creutzburg, R., Levialdi, S., Wolf, G. (eds) Recent Issues in Pattern Analysis and Recognition. Lecture Notes in Computer Science, vol 399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51815-0_41
Download citation
DOI: https://doi.org/10.1007/3-540-51815-0_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51815-0
Online ISBN: 978-3-540-46815-8
eBook Packages: Springer Book Archive