1．通过实验加深对快速傅立叶变换（FFT）基本原理的理解。

2．了解FFT点数与频谱分辨率的关系，以及两种加长序列FFT与原序列FFT的关系。

离散傅里叶变换（DFT）和卷积是信号处理中两个最基本也是最常用的运算，它们涉及到信号与系统的分析与综合这一广泛的信号处理领域。实际上卷积与DFT之间有着互通的联系：卷积可化为DFT来实现，其它的许多算法，如相关、滤波和谱估计等都可化为DFT来实现，DFT也可化为卷积来实现。-1. Deepen the experimental fast Fourier transform (FFT) the basic tenets of understanding. 2. Understand the FFT spectrum and points of the resolution, and two extended sequence with the original FFT FFT relations. Discrete Fourier Transform (DFT) and the convolution of two signal processing is the most commonly used basic arithmetic, they relate to the signal and system analysis and synthesis of the wide range of signal processing field. DFT actually convolution and interoperability between contact : DFT into convolution can be achieved in many other algorithms, If relevant, filtering and spectral estimation could be achieved as DFT, DFT into convolution can be achieved.