Fast Fourier Transform (FFT) is a rapid computation method for discrete Fourier transform (DFT). With improvement on DFT produced by utilizing some critical features, such as numeric parity, complexity or reality, FFT is achieved. FFT plays great roles in applications of digital signal processing. This paper studies basic theory and computation know-how of FFT firstly, then conducts spectrum analysis for some continuous signals with noise or not by Radix-2 FFT, finally discusses how to implement FFT on TMS320C54x DSP processor, original code and relevant result are both given. By the flow, roles of FFT in spectrum analysis and advantages of DSP for implementation of digital signal processing have been displayed.
Keyword:
Digital Signal Processing, Fast Fourier Transform, Algorithm, DSP, Spectrum Analysis
