一类特殊DFT的快速算法

Fast Algorithm of DFT with Only A Subset of Input or Output Points Using GFFT

摘要: 一般的DFT算法都假定输入和输出序列长度相等,实际的情况并非总是如此。鉴于此,文中讨论了输入和输出序列长度不相等的这类DFT的快速计算方法,其结果比Skinner的剪枝法和Sorensen,Burus的变换分解法更简洁高效。

Abstract: Most of FFT algorithms are designed for the general situation in which the length of input and output sequences are equal.In special situations,it should be studied carefully for practical applications.This paper provides a new algorithm using GFFT which is more efficient than pruning method,transform decomposition and so on.