A pure Cordic based FFT for reconfigurable digital signal processing

This paper presents a pure Cordic based architecture to calculate the FFT on a reconfigurable hardware accelerator. The performance of this approach can compete with the ordinary MAC based implementation on this accelerator, although the main advantage is the possibility to implement the FFT on a reconfigurable Cordic-only processor array. In a former publication it was already shown that the Rake receiver can be replaced by a Cordic based linear equalizer using the same architecture, which even results in a better performance. With the presented pure Cordic based FFT it is now possible to replace the main processing blocks of the WLAN and UMTS baseband by this programmable architecture.

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

[2]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[3]  M. Bucker,et al.  Matrix based signal processing on a reconfigurable hardware accelerator , 2002, Proceedings of 2002 IEEE 10th Digital Signal Processing Workshop, 2002 and the 2nd Signal Processing Education Workshop..

[4]  Alvin M. Despain,et al.  Fourier Transform Computers Using CORDIC Iterations , 1974, IEEE Transactions on Computers.

[5]  C. Loan Computational Frameworks for the Fast Fourier Transform , 1992 .

[6]  Jürgen Götze,et al.  A performance adjustable and reconfigurable CDMA receiver concept for UMTS-FDD , 2003, 14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003..