DocumentCode :
1186901
Title :
A pipelined tree machine architecture for computing a multidimensional convolution
Author :
Liu, Kuang Y.
Volume :
29
Issue :
4
fYear :
1982
fDate :
4/1/1982 12:00:00 AM
Firstpage :
201
Lastpage :
207
Abstract :
In this paper, a technique is proposed to decompose a two-dimensional (2-D) cyclic convolution of two d_{1} \\times d_{2} arrays, where d_{2} = 2^{m} with m > 1 , into many identical and independent 2-D cyclic convolutions of smaller size. Using this technique and the fact that fast polynomial transform (FFT) exists when d_{1}=2^{m-r+1} for 1 \\leq r \\leq m , a pipelined tree machine architecture composed of modular FPT, FFT, and Chinese Remainder Theorem (CRT) computational units is then developed to efficiently compute a 2-D cyclic convolution. Finally, the extension of this tree machine architecture to efficiently compute a multidimensional cyclic convolution is discussed in this paper.
Keywords :
Computer pipeline processing; Convolution; DSP; Digital signal processing (DSP); Multidimensional signal processing; Trees; Cathode ray tubes; Computer architecture; Convolution; Fast Fourier transforms; Hardware; Image processing; Multidimensional systems; Pipelines; Polynomials; Synthetic aperture radar;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/TCS.1982.1085137
Filename :
1085137
Link To Document :
بازگشت