Issue No. 06 - June (1971 vol. 20)
This note presents a new algorithm for computing the cyclic convolution of two vectors over a commutative ring. The algorithm requires n(n<inf>1</inf>+1)...(n<inf>k</inf>+1)/2<sup>k</sup>multiplications for the convolution of two n-vectors, where n=n<inf>1</inf>...n<inf>k</inf>is a factorization of n into factors which are pairwise relatively prime.
Convolution, cyclic matrix, supercirculant matrix.
Y. Zalcstein, "A Note on Fast Cyclic Convolution", IEEE Transactions on Computers, vol. 20, no. , pp. 665-666, June 1971, doi:10.1109/T-C.1971.223319