Sankar Basu
Journal of the Franklin Institute
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
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Conference paper
Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems