A pipelined tree machine architecture for computing a multidimensional convolution
Circuits and Systems, IEEE Transactions (1982)
摘要
In this paper, a technique is proposed to decompose a two-dimensional (2-D) cyclic convolution of two arrays, where with , 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 for , 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.
更多查看译文
关键词
Computer pipeline processing,Convolution,DSP,Digital signal processing (DSP),Multidimensional signal processing,Trees
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要