On a wideband fast fourier transform for a radio telescope

The radio telescope analyzes a radio frequency from celestial objects by using fast Fourier transform (FFT). In this application, its bandwidth f is wider than that of the typical FFT. Since the amount of hardware for the typical FFT circuit is proportional to the bandwidth f, a special technique is necessary for this application. This paper shows a realization of wideband FFT for the radio telescope on an FPGA. We show that the memory size for the conventional FFT, which consists of the twiddle factor memory and the transpose memory, is too large. We replace the twiddle factor memory with the pipelined CORDIC. To reduce the number of transpose memories, we increase the radix of the FFT from 22 to 2k, also we use the DDR2SDRAM to implement the transpose memory. We implement the 230-FFT on an Altera's Stratix IV GX530 FPGA. It performs the 230-FFT operations in 1.5 seconds. Compared with the Altera's FFT library, our FFT circuit realizes 214 times wider bandwidth on the same FPGA. Also, compared with Tesla S1070 utilizing four GPUs, our FFT circuit is faster and dissipates lower power.

[1]  Mats Torkelson,et al.  A new approach to pipeline FFT processor , 1996, Proceedings of International Conference on Parallel Processing.

[2]  W. Knight,et al.  A simple fixed-point error bound for the fast Fourier transform , 1979 .

[3]  Paul Murdin.  HALCA (Highly Advanced Laboratory for Communications and Astronomy/Muses-B) , 2000 .

[4]  Jack E. Volder.  The CORDIC Trigonometric Computing Technique , 1959, IRE Trans. Electron. Comput..

[5]  A. Siemion,et al.  PetaOp/Second FPGA Signal Processing for SETI and Radio Astronomy , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[6]  Ray Andraka,et al.  A survey of CORDIC algorithms for FPGA based computers , 1998, FPGA '98.

[7]  Akihiko Hirota,et al.  Variation of Molecular Gas Properties Across the Spiral Arms in IC 342: Large-Scale 13CO (1–0) Emission , 2010 .

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

[9]  Christos-Savvas Bouganis,et al.  GPU Versus FPGA for High Productivity Computing , 2010, 2010 International Conference on Field Programmable Logic and Applications.

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

[11]  Stefan Goedecker,et al.  Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply-Add Instructions , 1997, SIAM J. Sci. Comput..

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

[13]  Yingning Peng,et al.  Pipeline FFT Architectures Optimized for FPGAs , 2009, Int. J. Reconfigurable Comput..

[14]  Christoph W. Ueberhuber,et al.  MULTIPLY-ADD OPTIMIZED FFT KERNELS , 2001 .

[15]  Ephraim Feig,et al.  Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures , 1993, IEEE Trans. Signal Process..

[16]  Dan Werthimer,et al.  A Multi-GPU Spectrometer System for Real-Time Wide Bandwidth Radio Signal Analysis , 2010, International Symposium on Parallel and Distributed Processing with Applications.