Research Article
Vector Radix 2 × 2 Sliding Fast Fourier Transform
Table 2
Comparison of the processing time and the additional memory requirements.
| Algorithm | Processing time over 106 iterations for size window (ms) | Ratio versus 1D DFT ×2 (%) | Additional memory requirement for -points transform |
| 1D DFT ×2 | 23,908.47 | 100.00 | | 1D FFT ×2 | 4,711.57 | 19.71 | | 1D SFFT + 1-D FFT | 3,582.43 | 14.98 | | VR-2 × 2 FFT | 1,563.67 | 6.54 | | 2D MFFT | 678.89 | 2.84 | | 2D SDFT | 532.51 | 2.23 | | 1D rSDFT + 1-D FFT | 3,388.33 | 14.17 | | 1D mSDFT + 1-D FFT | 4,213.01 | 17.62 | | 1D gSDFT + 1-D FFT | 3,812.58 | 15.95 | | VR-2 × 2 SFFT | 876.87 | 3.67 | |
|
|