说明：  快速傅氏变换（FFT）是离散傅氏变换的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。它对傅氏变换的理论并没有新的发现，但是对于在计算机系统或者说数字系统中应用离散傅立叶变换，可以说是进了一大步。数字信号处理器(DSP)是一种可编程的高性能处理器，近年来发展很快．它不仅适用于数字信号处理，而且在图像处理、语音处理、通信等领域得到了广泛的应用．通用的微处理器在运算速度上很难适应信号实时处理的要求．联沪处理器中集成有高速的乘法器硬件，能快速地进行大量数据的乘法和加法运算。快速傅里叶变换(FFT)的出现使得DFr在实际应用中得到了广泛的应用．
(Fast Fourier Transform (FFT) is the 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. Digital signal processor (DSP) is a programmable high-performance processor, developed rapidly in recent years. It is not only applicable to digital signal processing, and image processing, speech processing, communications and other fields has been widely used. General computing speed of microprocessors is difficult to adapt in real-time signal processing requirements. Contact Shanghai high-speed processor integrated hardware multiplier, can carry large amounts of data fast multiplication and addition operations. Fast Fourier Transform (FFT) of the DFR s emergence made in practical applic)