用递归和W变换计算一维循环卷积

Computing One Dimensional Cyclic Convolution by Recurrsion and W Transform

本文利用递归和Ｗ变换得到了一维循环卷积计算的新方法，所需运算量比已有方法少。

In this paper,a fast algorithm for computing one dimensional cyclic convolution is presented by recurrsion and discrete W transform (DWT),the computation cost of that using new algorithm is less than that of other known algorithms.