期刊论文

中文

工程数学学报

1005-3085

2003

20

3

125-130

10.3969/j.issn.1005-3085.2003.03.021

国家数学天元基金（10026002 01 05 03）； 湖南省教委科研基金资助.；

本校为其他机构

对三维数字循环卷积的二元多项式变换算法详细进行了研究和改进，并给出了运算量的估算。我们将看到，改进后的算法对N-1×N-2×N-3的三维复序列的数字循环卷积约需2N-1N-2N-3 log8N-1N-2N-3次实乘和4N-1N-2N-3 log N-1N-2N-3 log N-3+2N-3～2次实加，与FFTr、FPT方法比较，所需运算量减少。

The algorithm for computation of three dimension digital cyclic convolutions with bivariate polynomial transform is researched and improved in detail. And the estimation of operations amounts is also given. As can be seen that while computing three dimension N1×N2×N3 complex digital convolutions with the algorithm improved, 2N1N2N3 log N1-8N1N2N3 times real multiplication operations and 4N1N2N3 log N1N2N3-N23 log N3+2N23 times real additive operations are needed. compared to FFT, in FPT methods, t...