Implementation of FFT algorithm based on FPGA
SU Jian-min
Abstract
SU Jian-min
Abstract
This paper shows how to realize the Fast Fourier Transform(FFT) using the technique of FPGA.The VHDL language is used to design the system,and after compiling,synthesizing and downloading,the simulation result is given.The Fast Fourier Transform(FFT) algorithm running on a FPGA chip has the advantages of high speed and excellent anti-disturb capability;and the FFT algorithm on FPGA described by VHDL can be migrated easily and used repeatedly,so the design efficiency is improved greatly.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper shows how to realize the Fast Fourier Transform(FFT) using the technique of FPGA.The VHDL language is used to design the system,and after compiling,synthesizing and downloading,the simulation result is given.The Fast Fourier Transform(FFT) algorithm running on a FPGA chip has the advantages of high speed and excellent anti-disturb capability;and the FFT algorithm on FPGA described by VHDL can be migrated easily and used repeatedly,so the design efficiency is improved greatly.
Key concepts: VHDL, Fast Fourier transform, Field-programmable gate array, Computer science, Prime-factor FFT algorithm, Upload, Hardware description language, Parallel computing