分析了按时间抽取（DIT）基-2快速傅里叶变换（FFT）的误差，数据格式为二进制补码。

The error of the decimate in time (DIT) radix-2 fast Fourier transform (FFT) is analyzed, where the data format is two's complement.

youdao

运用二进制方法对按时间抽取顺序输入倒序输出的基2 FFT算法进行了较为详细的分析和论证。

The decimation in time (DIT) radix-2 FFT algorithm is analyzed in details with input in normal order and output in bit-reversed order by the binary method.

youdao

本文首先对傅立叶变换的性质做了详细介绍，其中包括离散傅里叶变换，快速傅立叶变换（FFT）以及基-2按时间抽取（DIT）的FFT算法；

Firstly , the properties of Fourier Transform, including discrete Fourier Transform, FFT and based-2 DIT FFT, are introduced in this paper;

youdao