A generalized modified split-radix FFT algorithm for N=q×2m and its applications

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×2<sup>m</sup>, where q is a positive odd integer. Compared with former algorithms for N = q×2<sup>m</sup>, the proposed algorithm reduces the computation complexity of DFT from O(4Nlog<sub>2</sub>(N/q)) to O((34/9)Nlog<sub>2</sub>(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×2<sup>m</sup>, q = 5, 15 is used.

[1]  Guoan Bi,et al.  A unified expression for split-radix DFT algorithms , 2010, 2010 International Conference on Communications, Circuits and Systems (ICCCAS).

[2]  Steven G. Johnson,et al.  Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations , 2007, Signal Process..

[3]  Vladimir Britanak.  A survey of efficient MDCT implementations in MP3 audio coding standard: Retrospective and state-of-the-art , 2011, Signal Process..

[4]  Guoan Bi,et al.  Fast DFT algorithms for length N=q*2/sup m/ , 1998 .

[5]  R. Yavne,et al.  An economical method for calculating the discrete Fourier transform , 1899, AFIPS Fall Joint Computing Conference.

[6]  Steven G. Johnson,et al.  A Modified Split-Radix FFT With Fewer Arithmetic Operations , 2007, IEEE Transactions on Signal Processing.

[7]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[8]  M. Omair Ahmad,et al.  A new radix-2/8 FFT algorithm for length-q×2m DFTs , 2004, IEEE Trans. Circuits Syst. I Regul. Pap..

[9]  Kenli Li,et al.  Scaled Radix-2/8 Algorithm for Efficient Computation of Length-$N=2^{m}$ DFTs , 2014, IEEE Transactions on Signal Processing.

[10]  T. Lundy,et al.  A new matrix approach to real FFTs and convolutions of length 2k , 2007, Computing.

[11]  P. Duhamel,et al.  `Split radix' FFT algorithm , 1984 .

[12]  M. Omair Ahmad,et al.  A General Class of Split-Radix FFT Algorithms for the Computation of the DFT of Length-$2^{m}$ , 2007, IEEE Transactions on Signal Processing.

[13]  Lin Yang,et al.  Design of a 3780-point IFFT processor for TDS-OFDM , 2002, IEEE Trans. Broadcast..

[14]  I. Kamar,et al.  Conjugate pair fast Fourier transform , 1989 .

[15]  Daniel J. Bernstein,et al.  The Tangent FFT , 2007, AAECC.