FFTLast updated: January 19, 2003 |
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.
From | To | Value |
---|---|---|
8 | 8 | 0.005 |
16 | 16 | 0.143 |
24 | 24 | 0.330 |
32 | 32 | 0.080 |
40 | 40 | 0.087 |
48 | 72 | 0.240 |
80 | 136 | 0.068 |
144 | 392 | 0.038 |
400 | +Inf | 0.011 |
From | To | Value |
---|---|---|
1 | 1 | 0.977 |
2 | 2 | 0.021 |
3 | +Inf | 0.002 |
From | To | Value |
---|---|---|
1 | 1 | 0.986 |
2 | 2 | 0.012 |
3 | +Inf | 0.002 |
From | To | Value |
---|---|---|
1 | 1 | 0.991 |
2 | 2 | 0.004 |
3 | +Inf | 0.004 |
From | To | Value |
---|---|---|
1 | 1 | 0.993 |
2 | 2 | 0.001 |
3 | +Inf | 0.004 |
From | To | Value |
---|---|---|
1 | 1 | 1.000 |
2 | 2 | 0.000 |
3 | +Inf | 0.000 |
From | To | Value |
---|---|---|
1 | 1 | 1.000 |
2 | 2 | 0.000 |
3 | +Inf | 0.000 |
From | To | Value |
---|---|---|
1 | 1 | 1.000 |
2 | 2 | 0.000 |
3 | +Inf | 0.000 |
From | To | Value |
---|---|---|
1 | 1 | 1.000 |
2 | 2 | 0.000 |
3 | +Inf | 0.000 |