On computing the discrete Fourier transform

S. Winograd

1978Published

732Citations

0References

journal articleType

Abstract

A new algorithm for computing the Discrete Fourier Transform is described. The algorithm is based on a recent result in complexity theory which enables us to derive efficient algorithms for convolution. These algorithms are then used to obtain the new Discrete Fourier Transform algorithm.

Journal: Mathematics of Computation

Publisher: American Mathematical Society (AMS)

View on DOI

Citations are the number of DOI-registered works in Crossref that cite this paper; references are how many works it cites. Full text is on the publisher site via the DOI link.