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 real-time, 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.