FFT算法的C程序实现-----外文翻译.doc

Implementation of FFT and IFFT algorithm with C Language 1.Developing of FFT Finite sequence of discrete Fourier transform by (DFT) will be separated into its frequency domain are finite sequences. But its calculation is too big, difficult to deal with the problem in real time, it leads to a fast Fourier transform (FFT). In 1965, Cooley and Tukey proposed calculation of discrete Fourier transform (DFT) of the fast algorithm, the DFT computation to reduce the number of orders of magnitude. Since then, the fast Fourier transform (FFT) algorithm will continue in-depth, digital signal processing with this emerging disciplines, with the FFT and the emergence and development of rapid development. Based on the sequence of decomposition and the different selection methods produced a variety of FFT algorithms, the basic algorithm is based 2DIT and base 2DIF. FFT in the Fourier inverse transform, linear convolution and linear correlation also has important applications. Fast Fourier Transform (FFT), discrete Fourier Transform Algorithm, which is the discrete Fourier transform of the odd and even, true, real and other properties, on the discrete Fourier transform algorithm was modified to obtain. Fourier transform theory it is not a new discovery, but for the computer systems or digital systems using discrete Fourier transform, can be said that a big step into. Fourier transform is a kind of digital signal processing algorithm is very important. Fourier transform algorithm to know the meaning, we must first understand the meaning of Fourier theory. Fourier theory shows that: any continuous measurement of the timing or signal, can be expressed as a sine wave signals of different frequencies superimposed unlimited. Established under the principle of direct measurement using Fourier transform algorithm to the original signal to additive approach to calculating the signal sine wave signals of different frequency, amplitude and phase. And the corresponding Fourier transform algor