关于循环卷积的一个快速算法

Comments on the New Fast Algorithm for Circular Convolution

本文指出文献[3]提出的循环卷积快速算法由于忽略了整数位长与时间复杂度的关系,其一次乘法所耗费的时间至少相当于原有的卷积直接乘的时间.若不考虑整数的位长,只用一次乘法便可算出卷积.

It is pointed out that even a single multiplication in the so-called new fast algorithm for circular convolution put forward by Wang in reference[3] is actually not faster than the whole computation for circular convolution in direct multiplication. If the length of integer is ignored, as done by Wang, only one multiplication is enough to compute the convolution.