A Simplified Fast Fourier Transform Algorithm

As a Fast algorithm of Discrete Fourier Transform (DFT), Fast Fourier Transform (FFT) can quickly analyze discrete signal spectrum and is widely used in communication, radar, medical imaging and other systems. However, as the increase of signal points, the signal processing time and hardware resources occupation also increase, which limits the signal processing rate and the overall performance of the system to a certain extent. In this paper, a simplified fast Fourier transform algorithm is proposed to reduce the complexity of FFT system. By using the idea of "separating odd-even symmetric signal and splitting odd-even symmetric branch processing", the parallel branch of odd-even symmetric signal is adopted for FFT processing. Then the number of points participating in FFT processing is reduced from N to N/2 and the multiplication complexity can be reduced from (N/2)log2N to (N/2)log2(N/2). By this method, the FFT signal processing rate can be improved effectively.