快速傅立叶变换（FFT）算法实现 将DFT算法与FFT算法计算时间进行比较，分析二者的效率和精确差异。-Fast Fourier Transform (FFT) algorithm to DFT algorithm and FFT algorithm for computing time to carry out comparative analysis between the two differences in the efficiency and precision.

对图像做傅里叶变换的完整详细代码，包含测试图片的结果频谱图，用于图像的后续分析。-For complete details on the image to make the Fourier transform of the code, including the results of the test images spectrum for subsequent analysis of the image.

对一个不对称的实序列进行傅里叶分析，将信号分解为奇部和偶部，求出对应的傅里叶变化-Implementation of an asymmetric sequence Fourier analysis, the signal is decomposed into odd and even the Department of the Ministry, find the corresponding Fourier transform