Ronen Feldman, Martin Charles Golumbic
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
Fernando Martinez, Juntao Chen, et al.
AAAI 2025
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control