共轭反对称序列的DFT及其FFT算法

Conjugate Antisymmetric Series DFT and Its FFT Algorithm

对共轭反对称复数序列的离散傅立叶变换 (DFT)及其快速傅立叶变换 (FFT)算法进行了研究 ,获得了共轭反对称序列的 DFT具有实部为 0的性质 ,并开发出适用于共轭反对称序列的 FFT算法。该算法与传统的FFT算法相比减少了一半的计算量和存储单元。

The paper studies conjugate antisymmetric plural series discrete Fourier transform (DFT) and fast Fourier transform (FFT) and gets the attribute that the real part of conjugate antisymmetric series DFT is 0. A FFT algorithm is developed that is suitable for conjugate antisymmetric series, which reduces a half of the working capacity in computation and memory cells compared with conventional FFT algorithm.