The error of the decimate in time (DIT) radix-2 fast Fourier transform (FFT) is analyzed, where the data format is two's complement.
分析了按时间抽取（DIT）基-2快速傅里叶变换（FFT）的误差，数据格式为二进制补码。
2
Based on the prime radix DFT and number theory, an algorithm using the second order recursive filter and the zero factor prime radix Fourier Transform (ZFT) is presented.
从素基数DFT出发，应用数论理论讨论了一种应用二阶递归滤波结构的算法及零因子转换算法(ZFT)。
3
The radix-2 decimation-in-time algorithm based on 16-bit fixed-point operation and pipeline architecture are adopted in the core module IFFT(Inverse Fast Fourier Transform).