This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Performance Study of 16-bit Microcomputer-Implemented FFT Algorithms
October-December 1982 (vol. 2 no. 4)
pp. 61-66
P. Stigall, University of Missouri-Rolla
R. Ziemer, University of Missouri-Rolla
L. Hudec, University of Missouri-Rolla
An FFT algorithm operating on a 16-bit microcomputer can calculate a 256-point transform as much as 10 times faster than a similar algorithm on an eight-bit microcomputer.
Citation:
P. Stigall, R. Ziemer, L. Hudec, "A Performance Study of 16-bit Microcomputer-Implemented FFT Algorithms," IEEE Micro, vol. 2, no. 4, pp. 61-66, Oct.-Dec. 1982, doi:10.1109/MM.1982.291039
Usage of this product signifies your acceptance of the Terms of Use.