Title :
A Note on Fast Cyclic Convolution
fDate :
6/1/1971 12:00:00 AM
Abstract :
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.
Keywords :
Convolution, cyclic matrix, supercirculant matrix.; Bismuth; Computer applications; Computer science; Computerized monitoring; Convolution; Fast Fourier transforms; Fourier transforms; Military computing; Modules (abstract algebra); Convolution, cyclic matrix, supercirculant matrix.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1971.223319
