On computing the discrete Fourier transform

S. Winograd
1978 Mathematics of Computation  
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.
doi:10.1090/s0025-5718-1978-0468306-4 fatcat:xz3lx7tz6neh5e2khvopl23h5q