The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Researches of Algorithms for Computation of 3 Dimensions Digital Convolutions with Bivariate Polynomial Transform
Author(s): 
Pages: 125-130
Year: Issue:  3
Journal: CHINESE JOURNAL OF ENGINEERING MATHEMATICS

Keyword:  数字循环卷积快速傅立叶变换多项式变换多元多项式变换;
Abstract: 对三维数字循环卷积的二元多项式变换算法详细进行了研究和改进,并给出了运算量的估算.我们将看到,改进后的算法对N1×N2×N3的三维复序列的数字循环卷积约需2N1N2N3 log N1-8N1N2N3次实乘和4N1N2N3 log N1N2N3-N23 log N3+2N23 次实加,与FFT、FPT方法比较,所需运算量减少.
Related Articles
loading...