McGill

FFT

Last updated: January 19, 2003
Sable


Fast Fourier Transform (FFT) performs a one-dimensional forward transform of 4K complex numbers. This kernel exercises complex arithmetic, shuffling, non-constant memory references and trigonometric functions. The first section performs the bit-reversal portion (no flops) and the second performs the actual Nlog(N) computational steps. (Source: SciMark)

The data size for the execution was 4096.



Metrics


Back to Top