The effect of the digit slicing architecture on the FFT butterfly

Most communications systems tend to achieve bandwidth, power and cost efficiencies to capable to describe modulation scheme. Hence for signal modulation orthogonal frequency division multiplexing (OFDM) transceiver is introduced to cover communications demand in four generation. However high performance Fast Fourier Transforms (FFT) as a main heart of OFDM acts beyond the view. In order to achieve capable FFT, design and realization of its efficient internal structure is key issues of this research work. In this paper implementation of high performance butterfly for FFT by applying digit slicing technique is presented. The proposed design focused on the trade-off between the speed and active silicon area for the chip implementation. The new architecture was investigated and simulated with the MATLAB software. The Verilog HDL code in Xilinx ISE environment was derived to describe the FFT Butterfly functionality and was downloaded to Virtex II FPGA board.

[1]  S.K. Sahoo,et al.  Multiplier less FFT processor architecture for signal and image processing , 2005, Proceedings of 2005 International Conference on Intelligent Sensing and Information Processing, 2005..

[2]  T. Parks,et al.  A prime factor FFT algorithm using high-speed convolution , 1977 .

[3]  Salina Abdul Samad,et al.  Implementation of a high speed Fast Fourier Transform VLSI chip , 1998 .

[4]  Yi-Pin Hsu,et al.  Parallel-computing Approach for FFT Implementation on Digital Signal Processor (DSP) , 2008 .

[5]  S.A. White,et al.  Digital signal processing: Theory, design and implementation , 1977, Proceedings of the IEEE.

[6]  Bevan M. Baas,et al.  A low-power, high-performance, 1024-point FFT processor , 1999, IEEE J. Solid State Circuits.

[7]  Yuan Zhou,et al.  Novel design of multiplier-less FFT processors , 2007, Signal Processing.

[8]  Annamária R. Várkonyi-Kóczy,et al.  A recursive fast Fourier transformation algorithm , 1995 .

[9]  Alan V. Oppenheim,et al.  Discrete-time signal processing (2nd ed.) , 1999 .

[10]  Z.B.M.S. Abidin.  Digit-slicing architectures for real-time digital filters , 1980 .

[11]  A. W. M. van den Enden,et al.  Discrete Time Signal Processing , 1989 .

[12]  M. E. Woodward,et al.  A modular approach to the hardware implementation of digital filters , 1976 .

[13]  R. Singleton.  An algorithm for computing the mixed radix fast Fourier transform , 1969 .

[14]  M. Othman,et al.  FPGA Implementation of a Canonical Signed Digit Multiplier-less based FFT Processor for Wireless Communication Applications , 2006, 2006 IEEE International Conference on Semiconductor Electronics.

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

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

[17]  Y. Wang,et al.  Novel Memory Reference Reduction Methods for FFT Implementations on DSP Processors , 2007, IEEE Transactions on Signal Processing.