A Fast Algorithm Based on SRFFT for Length N = q × 2 m DFTs

In this brief, we present a fast algorithm for computing length-q × 2 discrete Fourier transforms (DFT). The algorithm divides a DFT of size-N = q × 2 decimation in frequency into one length-N/2 DFT and two length-N/4 DFTs. The length-N/2 sub-DFT is recursively decomposed decimation in frequency, and the two size-N/4 sub-DFTs are transformed into two dimension and the terms with the same rotating factor are arranged in a column. Thus, the scaled DFTs (SDFTs) are obtained, simplifying the real multiplications of the proposed algorithm. A further improvement can be achieved by the application of radix-2/8, modified split-radix FFT (MSRFFT), and Wang’s algorithm for computing its length-2 and length-q sub-DFTs. Compared with the related algorithms, a substantial reduction of arithmetic complexity and more accurate precision are obtained.

[1]  Chen-Yi Lee,et al.  A Generalized Mixed-Radix Algorithm for Memory-Based FFT Processors , 2010, IEEE Transactions on Circuits and Systems II: Express Briefs.

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

[3]  M. D. Macleod,et al.  Multiplierless Winograd and prime factor FFT implementation , 2004, IEEE Signal Processing Letters.

[4]  Sau-Gee Chen,et al.  A High-Throughput Radix-16 FFT Processor With Parallel and Normal Input/Output Ordering for IEEE 802.15.3c Systems , 2012, IEEE Transactions on Circuits and Systems I: Regular Papers.

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

[6]  Zhongde Wang,et al.  A prime factor fast W transform algorithm , 1992, IEEE Trans. Signal Process..

[7]  Tran-Thong,et al.  Fixed-point fast Fourier transform error analysis , 1976 .

[8]  Guoan Bi,et al.  Fast DFT Algorithms for Length , 1998 .

[9]  Martin Vetterli,et al.  Fast Fourier transforms: a tutorial review and a state of the art , 1990 .

[10]  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.

[11]  Erik G. Larsson,et al.  The Impact of Dynamic Voltage and Frequency Scaling on Multicore DSP Algorithm Design [Exploratory DSP] , 2011, IEEE Signal Processing Magazine.

[12]  Kenli Li,et al.  Split Radix Algorithm for Length $6^{m}$ DFT , 2013, IEEE Signal Processing Letters.

[13]  Truong Q. Nguyen,et al.  On the Fixed-Point Accuracy Analysis of FFT Algorithms , 2008, IEEE Transactions on Signal Processing.

[14]  M. Swamy,et al.  A new radix-2/8 FFT algorithm for length-q/spl times/2/sup m/ DFTs , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

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