FPGA Implementation of efficient FFT algorithm based on complex sequence

摘要：

Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT). In many applications the input data are purely realtime, and efficient FFT can satisfy the situation. FFT algorithm based on complex sequence is an improved algorithm of primary FFT. This paper studies how efficient FFT algorithm is implemented on the basis of Field Programmable Gate Array (FPGA). When processing the same sequence length of data such as data of voltage or image, the algorithm put forward in this paper can save half time that is used for the amount of calculation in theory. The simulation indicates that the calculation can reach equivalent precision and the system performs satisfactorily. The method can applied well in many real-time systems and image processing.

关键词： FFT FPGA real-time image processing

作者: Zou Wen Qiu Zhongpan Song Zhijun

作者单位: Cognitive Science Department, Xiamen University Xiamen, China

会议类型: 国际会议

会议名称: 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

会议地点: 厦门

会议语种:英文

页码: 614-617

在线出版日期: 2010-10-29（万方平台首次上网日期，不代表论文的发表时间）