IEEE Transactions on Computers · 1983 · 11 citations · 5 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureArithmetic FunctionsDigital Signal ProcessingFourier AnalysisPipeline ParallelismBasic ArithmeticDistributed Fourier TransformFast Fourier TransformFourier Transform
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.
5
On computing the Discrete Fourier Transform
S. Winograd · Proceedings of the National Academy of Sciences · 1976 · 251 citations · Full text
A 32 point monolithic FFT processor chip
Guy Covert · 2005 · 13 citations
Engineering, Computer Engineering, Electrical Engineering +17