This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Hardware Fourier Transformation Through Counting
May 1973 (vol. 22 no. 5)
pp. 433-441
S. Zohar, Jet Propulsion Laboratory, California Institute of Technology
Hardware Fourier transformations are considered with the goal of increasing speed through parallel operation. Two designs in which the basic element is a fast counter are developed. One is applicable when the number of transformed points N is prime while the other, requiring somewhat more hardware, is applicable to all N.
Index Terms:
Fast Fourier transformation for batches of arbitrary size, hardware Fourier transformation, high-precision Fourier transformation, relation of Fourier transformation to Hankel matrices, sign flipping in radix (-2), speedup through parallel computation.
Citation:
S. Zohar, "Fast Hardware Fourier Transformation Through Counting," IEEE Transactions on Computers, vol. 22, no. 5, pp. 433-441, May 1973, doi:10.1109/T-C.1973.223745
Usage of this product signifies your acceptance of the Terms of Use.