DocumentCode :
1095137
Title :
On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution
Author :
Truong, T.K. ; Reed, Irving S. ; Lipes, Richard G. ; Wu, Chialin
Author_Institution :
Jet Propulsion Laboratory, Pasadena, CA
Volume :
29
Issue :
1
fYear :
1981
fDate :
2/1/1981 12:00:00 AM
Firstpage :
91
Lastpage :
97
Abstract :
In this paper, a fast algorithm is developed to compute two-dimensional convolutions of an array of d1 × d2 complex number points where d2 =2mand d1 =2m-r+1for some 
. This new algorithm requires fewer multiplications and about the same number of additions as the conventional FFT method for computing the two-dimensional convolution. It also has the advantage that the operation of transposing the matrix of data can be avoided.
. This new algorithm requires fewer multiplications and about the same number of additions as the conventional FFT method for computing the two-dimensional convolution. It also has the advantage that the operation of transposing the matrix of data can be avoided.Keywords :
Cathode ray tubes; Convolution; Dynamic range; Fast Fourier transforms; Filtering; Galois fields; Military computing; NASA; Polynomials; Signal processing algorithms;
fLanguage :
English
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
0096-3518
Type :
jour
DOI :
10.1109/TASSP.1981.1163520
Filename :
1163520
Link To Document :
