The Community for Technology Leaders
RSS Icon
Issue No.03 - March (1983 vol.32)
pp: 301-306
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.K. Truong, K.Y. Liu, I.S. Reed, "A Parallel-Pipeline Architecture of the Fast Polynomial Transform for Computing a Two-Dimensional Cyclic Convolution", IEEE Transactions on Computers, vol.32, no. 3, pp. 301-306, March 1983, doi:10.1109/TC.1983.1676222
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool