时域抽取多维向量基快速傅里叶变换

Multi-dimensional vector radix fast Fourier transform with decimation in time domain

给出了时域抽取(DIT)多维向量基快速傅里叶变换(FFT)算法.对多维信号采用基2时域抽取的方法,导出了该算法蝶形运算的一般形式,并提出了时域抽取多维向量基FFT(正序输入倒序输出)程序框图.计算量比较结果显示,时域抽取多维向量基FFT算法比多维分离式FFT算法计算量低.

A multi-dimensional vector radix Fast Fourier Transform（FFT） algorithm with Decimation in Time Domain（DIT） is presented.Through the method of vector radix 2 DIT to the multi-dimensional signal,we get the general form of butterfly computation of the algorithm,and put forward a DIT multi-dimensional vector radix FFT algorithm（Input in positive order and output in bit-reversed order） programming flow chart.The results show that,compared with multi-dimensional separable FFT,the DIT multi-dimensional vector radix FFT algorithm possesses in lower calculation load.