论文部分内容阅读
本文首先提出用多项式逆变换计算二维DFT的方法(k_2是奇数t或偶数分别讨论),然后再讨论混合算法。对于N×N(N=2~t)二维DFT,混合算法所需的运算量为(?) 与通常以2为基的二维FFT(行列算法)比较,加法次数相同,乘法次数减少,约20-40%。
In this paper, we first propose a method of computing two-dimensional DFT by inverse polynomial transformation (k 2 is odd or even, respectively), and then discuss the hybrid algorithm. For N × N (N = 2 ~ t) two-dimensional DFT, the amount of computation required for the hybrid algorithm is (?) Compared to a 2-dimensional FFT About 20-40%.