A Pipelined FFT Architecture for Real-Valued Signals

This paper presents a new pipelined hardware architecture for the computation of the real-valued fast Fourier transform (RFFT). The proposed architecture takes advantage of the reduced number of operations of the RFFT with respect to the complex fast Fourier transform (CFFT), and requires less area while achieving higher throughput and lower latency. The architecture is based on a novel algorithm for the computation of the RFFT, which, contrary to previous approaches, presents a regular geometry suitable for the implementation of hardware structures. Moreover, the algorithm can be used for both the decimation in time (DIT) and decimation in frequency (DIF) decompositions of the RFFT and requires the lowest number of operations reported for radix 2. Finally, as in previous works, when calculating the RFFT the output samples are obtained in a scrambled order. The problem of reordering these samples is solved in this paper and a pipelined circuit that performs this reordering is proposed.

[1]  Rainer Storn,et al.  Some results in fixed point error analysis of the Bruun-FTT algorithm , 1993, IEEE Trans. Signal Process..

[2]  Chien-In Henry Chen,et al.  Dual thresholding for digital wideband receivers with variable truncation scheme , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[3]  Glenn D. Bergland,et al.  Numerical Analysis: A fast fourier transform algorithm for real-valued series , 1968, CACM.

[4]  A. J..  New architecture for RFFT calculation , 2004 .

[5]  Mu-Huo Cheng,et al.  A real-time maximum-likelihood heart-rate estimator for wearable textile sensors , 2008, 2008 30th Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[6]  E. Brigham,et al.  The fast Fourier transform and its applications , 1988 .

[7]  Anantha Chandrakasan,et al.  Energy-aware architectures for a real-valued FFT implementation , 2003, ISLPED '03.

[8]  Shousheng He,et al.  Design and implementation of a 1024-point pipeline FFT processor , 1998, Proceedings of the IEEE 1998 Custom Integrated Circuits Conference (Cat. No.98CH36143).

[9]  S. Randel,et al.  24-Gb/s Transmission over 730 m of Multimode Fiber by Direct Modulation of an 850-nm VCSEL Using Discrete Multi-Tone Modulation , 2007, OFC 2007.

[10]  Winthrop W. Smith.  Handbook of Real-Time Fast Fourier Transforms , 1995 .

[11]  Hsiang-Feng Chi,et al.  A cost-effective memory-based real-valued FFT and Hermitian symmetric IFFT processor for DMT-based wire-line transmission systems , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[12]  Yun-Nan Chang,et al.  An Efficient VLSI Architecture for Normal I/O Order Pipeline FFT Design , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.

[13]  G. Bergland,et al.  A radix-eight fast Fourier transform subroutine for real-valued series , 1969 .

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

[15]  Alan V. Oppenheim,et al.  Discrete-time Signal Processing. Vol.2 , 2001 .

[16]  E. V. Jones,et al.  A pipelined FFT processor for word-sequential data , 1989, IEEE Trans. Acoust. Speech Signal Process..

[17]  Chein-Wei Jen,et al.  High-speed and low-power split-radix FFT , 2003, IEEE Trans. Signal Process..

[18]  Rainer Storn.  A novel radix-2 pipeline architecture for the computation of the DFT , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[19]  O.W. Ibraheem,et al.  Design and Simulation of Asymmetric Digital Subscriber Line (ADSL) Modem , 2008, 2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications.

[20]  C. K. Yuen,et al.  Theory and Application of Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[21]  E.E. Swartzlander,et al.  A radix 4 delay commutator for fast Fourier transform processor implementation , 1984, IEEE Journal of Solid-State Circuits.

[22]  K. M. M. Prabhu,et al.  Radix-2 decimation-in-frequency algorithm for the computation of the real-valued FFT , 1999, IEEE Trans. Signal Process..

[23]  Keshab K. Parhi,et al.  High-Throughput VLSI Architecture for FFT Computation , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

[24]  G. Bruun.  z-transform DFT filters and FFT's , 1978 .

[25]  Liang Yang,et al.  An efficient locally pipelined FFT processor , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.

[26]  Yuhang Wu.  New FFT structures based on the Bruun algorithm , 1990, IEEE Trans. Acoust. Speech Signal Process..

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

[28]  Chen-Yi Lee,et al.  Design of an FFT/IFFT Processor for MIMO OFDM Systems , 2007, IEEE Transactions on Circuits and Systems I: Regular Papers.

[29]  Douglas L. Jones,et al.  Corrections to "Real-valued fast Fourier transform algorithms" , 1987, IEEE Trans. Acoust. Speech Signal Process..

[30]  J. Grajal,et al.  Digital channelized receiver based on time-frequency analysis for signal interception , 2005, IEEE Transactions on Aerospace and Electronic Systems.

[31]  Refet Firat Yazicioglu,et al.  Low-Power Low-Noise 8-Channel EEG Front-End ASIC for Ambulatory Acquisition Systems , 2006, 2006 Proceedings of the 32nd European Solid-State Circuits Conference.