Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Paper
On computing the discrete fourier transform
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. © 1978 American Mathematical Society.
Related
Imran Nasim, Michael E. Henderson
Mathematics
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications