The decimationintime (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算法进行了较为详细的分析和论证。
2
This paper studies the parallelism of the different stages of decimationintime radix 2 FFT algorithm, designs the butterfly and scramble kernels and implements 2d FFT on GPU.
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).