Split Vector-Radix-2/8 2-D Fast Fourier Transform

Soo‐Chang Pei, W.-Y. Chen · IEEE Signal Processing Letters · 2004

This letter presents an efficient split vector-radix-2/8 fast Fourier transform (FFT) algorithm. The split vector-radix-2/8 FFT algorithm saves 14% real multiplications and has much lower arithmetic complexity than the split vector-radix-2/4 FFT algorithm. Moreover, this algorithm reduces 25% data loads and stores compared with the split vector-radix-2/4 FFT algorithm.

Read the paper · More papers on PaperTik