The Community for Technology Leaders
Green Image
Abstract?An efficient algorithm is presented for performing the Fourier transformation operation on a digital computer. This algorithm completes the transform calculation with Nlog<inf>2</inf>N complex additions (complex additions include complex subtractions) and ?N [log<inf>2</inf>(N)-2]+1 complex multiplications. This is a considerable savings over a brute-force method of N<sup>2</sup>complex additions and multiplications, especially when considering the use of digital machines whose MULTIPLY time is much longer than ADD time.
Index terms?Fast Fourier transform algorithm, Fourier transforms, spectral analysis.
H. Andrews, "A High-Speed Algorithm for the Computer Generation of Fourier Transforms", IEEE Transactions on Computers, vol. 17, no. , pp. 373-375, April 1968, doi:10.1109/TC.1968.229396
90 ms
(Ver 3.3 (11022016))