A new algorithm of deconvolution via window convolution operation is proposed, and the algorithm can solve the ill-posed problem occurring in deconvolution via circular convolution.
本文提出了一种用窗口卷积实现反卷积的新算法，这种算法解决了用圆周卷积计算反卷积时出现的病态问题。
In this paper, algorithms for computing 2-d circular convolution by using Fast Polynomial Transform (FPT) are reviewed and discussed, and then an improved algorithm is presented.
本文研究利用快速多项式变换(FPT)计算二维循环卷积的几种算法，改进了其中的一种算法，编制了相应的计算机程序。
应用推荐