This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Parallel-Pipeline Architecture of the Fast Polynomial Transform for Computing a Two-Dimensional Cyclic Convolution
March 1983 (vol. 32 no. 3)
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 d1? d2complex number points, where d1 = 2m-r+1and d2= 2mfor 1 = r = m.
Index Terms:
pipeline, Cyclic convolution, fast polynomial transform, FFT butterfly
Citation:
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
Usage of this product signifies your acceptance of the Terms of Use.