David A. Harville
Linear Algebra and Its Applications
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
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Conference paper
Simulation of X-ray mask defect printability
B.S. Bollepalli, Scott D. Hector, et al.
Microlithography 1997
John S. Lew
Mathematical Biosciences