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.
运用二进制方法对按时间抽取顺序输入倒序输出的基2 FFT算法进行了较为详细的分析和论证。
Aimed at the less detection precision and the more errors arising from the common electric parameter detecting method, this paper proposes a synchronous sampling method and radix 2 FFT algorithm.
针对普通电参数检测方法检测精度低、误差大的缺点，提出了一种同步采样法和基2 FFT算法。
This paper studies the parallelism of the different stages of decimation in time radix 2 FFT algorithm, designs the butterfly and scramble kernels and implements 2d FFT on GPU.
本文研究了基2的时域抽取快速傅立叶变换各阶段的并行性，并据此设计了相应的蝶形和倒序运算核，在GPU上实现了二维fft运算。
This FFT algorithm can be used with arbitrary integer dimensions. For 1-dimension, the algorithm will be simplified as the well-known DIF vector radix 2 FFT.
该FFT算法适合于维数为任意整数的情况，当维数为1时，算法退化为著名的频域抽取向量基2 FFT算法。
This FFT algorithm can be used with arbitrary integer dimensions. For 1-dimension, the algorithm will be simplified as the well-known DIF vector radix 2 FFT.
该FFT算法适合于维数为任意整数的情况，当维数为1时，算法退化为著名的频域抽取向量基2 FFT算法。
应用推荐