DocumentCode
1108763
Title
A Note on Fast Cyclic Convolution
Author
Zalcstein, Y.
Issue
6
fYear
1971
fDate
6/1/1971 12:00:00 AM
Firstpage
665
Lastpage
666
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 ...nk is 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.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1971.223319
Filename
1671912
Link To Document