Datapath-regular implementation and scaled technique for N=3×2m DFTs

Discrete Fourier transform (DFT) is used widely in almost all fields of science and engineering, and is generally calculated using the fast Fourier transform (FFT) algorithm. In this paper, we present a fast algorithm for efficiently computing a DFT of size 3×2m. The proposed algorithm decomposes the DFT, obtaining one length-2m unscaled sub-DFT and two length-2m sub-DFTs scaled by constant real numbers. For efficiently computing the scaled sub-DFTs, the constant real factors are attached to twiddle factors, combining them into new twiddle factors. By using this approach, the number of real multiplications is reduced compared with existing algorithms. To obtain regular datapath, a novel implementation method is presented aiming at the implementation of the proposed algorithm and making its datapath regular like the radix-2 FFT algorithm. The method can be applied to other algorithms with L-shape butterfly. Experimental result shows that, the proposed algorithm consumes less processing time than the existing algorithms for all scale DFTs, and than FFTW, a C subroutine library of FFTs, just for small scale DFTs. HighlightsWe present an algorithm for the computation of 3×2m DFTs, adopting the scaled DFT technique.The adopted technique can reduce the number of operations and improve precision.We propose an implementing method for radix-2/8 FFT.The method can make datapath of radix-2/8 FFT regular like radix-2.The proposed algorithm and method can be applied to DFTs of other lengths.

[1]  Erik Jonsson,et al.  Increased Memory Performance During Vector Accesses Through the use of Linear Address Transformations , 1992 .

[2]  Kenli Li,et al.  A Fast Algorithm Based on SRFFT for Length N = q × 2 m DFTs , 2013 .

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

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

[5]  Kenli Li,et al.  A Fast Algorithm Based on SRFFT for Length $N = q\times 2^{m}$ DFTs , 2014, IEEE Transactions on Circuits and Systems II: Express Briefs.

[6]  Hsi-Chin Hsin,et al.  Low-power and high-speed CORDIC-based split-radix FFT processor for OFDM systems , 2010, Digit. Signal Process..

[7]  Myung Hoon Sunwoo,et al.  New continuous-flow mixed-radix (CFMR) FFT Processor using novel in-place strategy , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[8]  Yaowu Chen,et al.  Pruning split-radix FFT with time shift , 2011, 2011 International Conference on Electronics, Communications and Control (ICECC).

[9]  Chih-Peng Fan,et al.  Pruning fast Fourier transform algorithm design using group-based method , 2007, Signal Process..

[10]  C. Temperton.  A new set of minimum-add small- n rotated DFT modules , 1988 .

[11]  C. Rader.  Discrete Fourier transforms when the number of data samples is prime , 1968 .

[12]  Manish Goel,et al.  A high performance split-radix FFT with constant geometry architecture , 2012, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE).

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

[14]  D. Cohen.  Simplified control of FFT hardware , 1976 .

[15]  Henk D. L. Hollmann,et al.  Implementation of "Split-radix" FFT algorithms for complex, real, and real symmetric data , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[16]  Guoan Bi.  Fast algorithms for DFT of composite sequence lengths , 1998, Signal Process..

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

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

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

[20]  Fred J. Taylor,et al.  A Radix-4 FFT Using Complex RNS Arithmetic , 1985, IEEE Transactions on Computers.

[21]  Dileep Bhandarkar,et al.  Analysis of Memory Interference in Multiprocessors , 1975, IEEE Transactions on Computers.

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

[23]  Charles E. Leiserson,et al.  Cache-Oblivious Algorithms , 2003, CIAC.

[24]  Sanjit K. Mitra,et al.  Sampling rate conversion based on DFT and DCT , 2013, Signal Process..

[25]  StankovićLJubiša,et al.  Fractional Fourier transform as a signal processing tool , 2011 .

[26]  Swapna Banerjee,et al.  A VLSI array architecture for realization of DFT, DHT, DCT and DST , 2001, Signal Process..

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

[28]  S. Winograd.  On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[29]  Steven G. Johnson,et al.  The Design and Implementation of FFTW3 , 2005, Proceedings of the IEEE.

[30]  Dionysios I. Reisis,et al.  Conflict-Free Parallel Memory Accessing Techniques for FFT Architectures , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[31]  James S. Walker.  Fast Fourier Transforms , 1991 .

[32]  T. Mančal,et al.  Evidence for wavelike energy transfer through quantum coherence in photosynthetic systems , 2007, Nature.

[33]  Hanho Lee,et al.  A High-Speed Two-Parallel Radix-24 FFT/IFFT Processor for MB-OFDM UWB Systems , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[34]  C. Sidney Burrus,et al.  On computing the split-radix FFT , 1986, IEEE Trans. Acoust. Speech Signal Process..

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

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

[37]  P. Laguna,et al.  Signal Processing , 2002, Yearbook of Medical Informatics.

[38]  Ken'iti Kido,et al.  A new FFT algorithm of radix 3, 6, and 12 , 1986, IEEE Trans. Acoust. Speech Signal Process..

[39]  LJubisa Stankovic,et al.  Fractional Fourier transform as a signal processing tool: An overview of recent developments , 2011, Signal Process..

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

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