14-04-2014, 04:37 PM
FFT in Hardware and Software
Hardware and Software.ppt (Size: 477.5 KB / Downloads: 117)
DFT Computation
A summation over the whole input array for every single element in the output array.
A VERY computationally inefficient algorithm to implement.
FFT Computation
A much more computationally efficient algorithm
Works using the divide and conquer principle.
First developed by Cooley and Tukey in 1965!
FFT Butterfly Operations
Butterfly arrangement of computations
Repeated on successive pairs of input data
Then half as many times on alternating pairs
Then half again as many times on every fourth element
…
Published Results
The Radix 4 version delivers a 1 K points complex processing time of 25 microseconds at 200-MHz system speeds and uses only about 10 percent of the resources in a mid-range Stratix device. The Radix 2 is half the size of the Radix 4 and offers a 1 K points complex processing time of 50 microseconds at 200-MHz system speeds. Additional versions of the new cores are under development. [6]