This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Note on Fast Cyclic Convolution
June 1971 (vol. 20 no. 6)
pp. 665-666
This note presents a new algorithm for computing the cyclic convolution of two vectors over a commutative ring. The algorithm requires n(n1+1)...(nk+1)/2kmultiplications for the convolution of two n-vectors, where n=n1...nkis 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," IEEE Transactions on Computers, vol. 20, no. 6, pp. 665-666, June 1971, doi:10.1109/T-C.1971.223319
Usage of this product signifies your acceptance of the Terms of Use.