A Parallel-Pipeline Architecture of the Fast Polynomial Transform for Computing a Two-Dimensional Cyclic Convolution
Issue No. 03 - March (1983 vol. 32)
T.K. Truong , Jet Propulsion Laboratory, California Institute of Technology
In this paper, a parallel-pipeline, radix-2 architecture is proposed to implement the fast polynomial transform (FPT). It is shown that such a structure can be used to efficiently compute a two-dimensional convolution of d<inf>1</inf>? d<inf>2</inf>complex number points, where d1 = 2<sup>m-r+1</sup>and d<inf>2</inf>= 2<sup>m</sup>for 1 = r = m.
pipeline, Cyclic convolution, fast polynomial transform, FFT butterfly
T. Truong, I. Reed and K. Liu, "A Parallel-Pipeline Architecture of the Fast Polynomial Transform for Computing a Two-Dimensional Cyclic Convolution," in IEEE Transactions on Computers, vol. 32, no. , pp. 301-306, 1983.