David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Charles A Micchelli
Journal of Approximation Theory
Charles Micchelli
Journal of Approximation Theory
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering