|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
A High-Speed Algorithm for the Computer Generation of Fourier Transforms
April 1968 (vol. 17 no. 4)
pp. 373-375
| ASCII Text | x | ||
| H. Andrews, "A High-Speed Algorithm for the Computer Generation of Fourier Transforms," IEEE Transactions on Computers, vol. 17, no. 4, pp. 373-375, April, 1968. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1968.229396, author = {H. Andrews}, title = {A High-Speed Algorithm for the Computer Generation of Fourier Transforms}, journal ={IEEE Transactions on Computers}, volume = {17}, number = {4}, issn = {0018-9340}, year = {1968}, pages = {373-375}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1968.229396}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A High-Speed Algorithm for the Computer Generation of Fourier Transforms IS - 4 SN - 0018-9340 SP373 EP375 EPD - 373-375 A1 - H. Andrews, PY - 1968 KW - Index terms?Fast Fourier transform algorithm KW - Fourier transforms KW - spectral analysis. VL - 17 JA - IEEE Transactions on Computers ER - | |||
Abstract?An efficient algorithm is presented for performing the Fourier transformation operation on a digital computer. This algorithm completes the transform calculation with Nlog2 N complex additions (complex additions include complex subtractions) and ?N [log2 (N)-2]+1 complex multiplications. This is a considerable savings over a brute-force method of N2complex additions and multiplications, especially when considering the use of digital machines whose MULTIPLY time is much longer than ADD time.
Index Terms:
Index terms?Fast Fourier transform algorithm, Fourier transforms, spectral analysis.
Citation:
H. Andrews, "A High-Speed Algorithm for the Computer Generation of Fourier Transforms," IEEE Transactions on Computers, vol. 17, no. 4, pp. 373-375, April 1968, doi:10.1109/TC.1968.229396
Usage of this product signifies your acceptance of the Terms of Use.

