Vector Radix 2 × 2 Sliding Fast Fourier Transform

Table 1

Computational requirements of the 2D DFT/FFT algorithms for input data in the sliding window scenario.

Algorithm	Operation	Window size
		1D DFT ×2		512	4,096	32,768	262,144	2,097,152
	448		3,840	31,744	258,048	2,080,768
1D FFT ×2		128	768	4,096	20,480	98,304
		192	1,152	6,144	30,720	147,456
1D SFFT + 1-D FFT		112	608	3,008	14,208	65,280
		168	912	4,512	21,312	97,920
VR-2 × 2 FFT		96	576	3,072	15,360	73,728
		176	1,056	5,632	28,160	135,168
2D MFFT		80	304	1,152	4,416	17,152
		92	336	1,232	4,608	17,600
2D SDFT		80	288	1,088	4,224	16,640
		78	282	1,074	4,194	16,578
1D rSDFT + 1-D FFT		160	768	3,584	16,384	73,728
		192	960	4,608	21,504	98,304
1D mSDFT + 1-D FFT		256	1,152	5,120	22,528	98,304
		256	1,216	5,632	25,600	114,688
1D gSDFT + 1-D FFT		64	512	2,816	14,336	69,632
		134	912	4,768	23,616	112,768
VR-2 × 2 SFFT		48	224	960	3,968	16,128
		96	448	1,920	7,936	32,256