A generalized modified split-radix FFT algorithm for N=q×2m and its applications
Jiasong Wu, L. W. Jiang, Yang Chen, Lotfi Senhadji, Huazhong Shu · 2014
This paper presents a generalized odd factor modified split-radix-2/4 Fast Fourier transform (FFT) algorithm for computing the DFT of length-N = q×2m, where q is a positive odd integer. Compared with former algorithms for N = q×2m, the proposed algorithm reduces the computation complexity of DFT from O(4Nlog2(N/q)) to O((34/9)Nlog2(N/q)) for complex input. The proposed algorithm can be applied to some international wireless standards where the length of DFT is not a power of two, and to some international speech and audio standards where the modified discrete cosine transform (MDCT) with length-N = q×2m, q = 5, 15 is used.