摘要
本文研究了环中卷积的快速计算问题,讨论了计算域中卷积通常使用的Wino-grad 短卷积算法、快速富里叶变换算法以及多项式变换算法对一般环中卷积计算的可适用性。特别地,对应用广泛的矩阵多项式乘积、矩阵卷积及多项式卷积计算提出了比直接计算快得多的算法。
This paper discusses the problem of fast computation of convolutions inrings.The adaptability of the well-known Winograd algorithm,FPT algorithmand FFT algorithm which are proposed for computing convolutions in complexfields is studied in the case of rings.Especially,fast algorithms for compu-ting multiplication of matrix polynomial,matrix convolution and polynomialconvolution are proposed.They are of wide practical usage.
出处
《国防科技大学学报》
EI
CAS
CSCD
北大核心
1990年第3期63-69,共7页
Journal of National University of Defense Technology
关键词
环
卷积
快速算法
近世代数
modern algebra
ring
convolution
fast algorithm
