The Community for Technology Leaders
Green Image
Issue No. 06 - June (1971 vol. 20)
ISSN: 0018-9340
pp: 665-666
ABSTRACT
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.
INDEX TERMS
Convolution, cyclic matrix, supercirculant matrix.
CITATION

Y. Zalcstein, "A Note on Fast Cyclic Convolution," in IEEE Transactions on Computers, vol. 20, no. , pp. 665-666, 1971.
doi:10.1109/T-C.1971.223319
88 ms
(Ver 3.3 (11022016))