Description: The FFT architecture is pipelined on a rank basis each rank has
its own butterfly and ranks are isolated from each other using
memory interleavers. This FFT can perform calculations on
continuous streaming data (one data set right after another).
More over, inputs and outputs are passed in pairs, doubling the
bandwidth. For instance, a 4096 point FFT can perform a transform
every 2048 cycles
To Search:
File list (Check if you may need any files):
65242541cf_fft_latest.tar
Download