loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The FFT: An Algorithm the Whole Family Can Use
January/February 2000 (vol. 2 no. 1)
pp. 60-64
ASCII Text
x 
 
Daniel N. Rockmore, "The FFT: An Algorithm the Whole Family Can Use," Computing in Science and Engineering, vol. 2, no. 1, pp. 60-64, January/February, 2000.
 
 
BibTex
x
 
@article{ 10.1109/5992.814659,
author = {Daniel N. Rockmore},
title = {The FFT: An Algorithm the Whole Family Can Use},
journal ={Computing in Science and Engineering},
volume = {2},
number = {1},
issn = {1521-9615},
year = {2000},
pages = {60-64},
doi = {http://doi.ieeecomputersociety.org/10.1109/5992.814659},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - Computing in Science and Engineering
TI - The FFT: An Algorithm the Whole Family Can Use
IS - 1
SN - 1521-9615
SP60
EP64
EPD - 60-64
A1 - Daniel N. Rockmore,
PY - 2000
VL - 2
JA - Computing in Science and Engineering
ER -
 
The fast Fourier transform is one of the fundamental algorithm families in digital information processing. The author discusses its past, present, and future, along with its important role in our current digital revolution.
Citation:
Daniel N. Rockmore, "The FFT: An Algorithm the Whole Family Can Use," Computing in Science and Engineering, vol. 2, no. 1, pp. 60-64, Jan./Feb. 2000, doi:10.1109/5992.814659
Usage of this product signifies your acceptance of the Terms of Use.