This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Pipelined Distributed Arithmetic PFFT Processor
December 1983 (vol. 32 no. 12)
pp. 1128-1136
P. Chow, Department of Electrical Engineering, University of Toronto
Previous experience in implementing the prime factor Fourier transform (PFFT) showed that it was much more difficult to do than the FF because of its complicated structure. In most FFT implementations the "butterfly" structure is the basic arithmetic element implemented. It is much simpler than the equivalent PFFT unit.
Index Terms:
prime factor Fourier transform, Distributed arithmetic, fast Fourier transform
Citation:
P. Chow, Z. Vranesic, null Jui Lin Yen, "A Pipelined Distributed Arithmetic PFFT Processor," IEEE Transactions on Computers, vol. 32, no. 12, pp. 1128-1136, Dec. 1983, doi:10.1109/TC.1983.1676173
Usage of this product signifies your acceptance of the Terms of Use.