FPGA Implementation of a Canonical Signed Digit Multiplier-less based FFT Processor for Wireless Communication Applications

This paper proposes a novel fully parallel FFT architecture based on canonical signed digit (CSD) multiplier-less targeting wireless communication applications, such as IEEE802.15.3a wireless personal area network (WPAN) baseband. The proposed architecture has the advantages of high throughput, less latency, and smaller area. The multiplier-less architecture uses shift- and-add operations to realize the complex multiplier and uses the CSD to optimize these operations. The design has been coded in Verilog HDL targeting Xilinx Virtex-II FPGA series. It is fully implemented and tested on real hardware using Virtex-II FG456 prototype board. Based on this architecture, the implementation of 8-points FFT on Virtex-II can run at a maximum clock frequency of about 400 MHz which lead to about 3.2 GS/s throughput with a latency of 6 clock cycles using 16,580 equivalent gates. Comparison with a conventional parallel architecture design of the same size can run only at a maximum clock frequency of 220 MHz or 1.76 GS/s throughput with a latency of 12 clock cycles using 77,418 equivalent gates for the design. The resulting throughput increases by about 82% while the equivalent gates and latency decrease by about 79% and 50% respectively.

[1]  Chris Dick FPGA based systolic array architectures for computing the discrete Fourier transform , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[2]  Vassilis Paliouras,et al.  An efficient computational method and a VLSI architecture for digital filtering of CP-OFDM signals , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[3]  T. Sansaloni,et al.  Distributed arithmetic radix-2 butterflies for FPGA , 2001, ICECS 2001. 8th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.01EX483).

[4]  E. L. Zapata,et al.  Area-efficient architecture for Fast Fourier transform , 1999 .

[5]  Khaled Benkrid,et al.  A high-level implementation of a high performance pipeline FFT on Virtex-E FPGAs , 2004, IEEE Computer Society Annual Symposium on VLSI.

[6]  Ayan Banerjee,et al.  FPGA realization of a CORDIC based FFT processor for biomedical signal processing , 2001, Microprocess. Microsystems.

[7]  Weidong Li,et al.  A pipeline FFT processor , 1999, 1999 IEEE Workshop on Signal Processing Systems. SiPS 99. Design and Implementation (Cat. No.99TH8461).

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

[9]  T. Sansaloni,et al.  FPGA-based radix-4 butterflies for HIPERLAN/2 , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[10]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.