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）的误差，数据格式为二进制补码。
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)。
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).
核心模块快速傅立叶逆变换（IFFT）采用基于16位定点运算的基-2时间抽取算法和流水线结构。
The fast algorithms of the real-valued Haar-type orthogonal transforms are discussed, and it is shown that the fast algorithms of the generalized Haar transform and the mixed radix Haa…
本文还讨论了实值哈尔型正交变换的快速算法问题，并指出，广义哈尔变换、混合基哈尔变换的快速算法完全适合于对应的实值哈尔型变换。
The fast algorithms of the real-valued Haar-type orthogonal transforms are discussed, and it is shown that the fast algorithms of the generalized Haar transform and the mixed radix Haa…
本文还讨论了实值哈尔型正交变换的快速算法问题，并指出，广义哈尔变换、混合基哈尔变换的快速算法完全适合于对应的实值哈尔型变换。
应用推荐