Issue No. 07 - July (1983 vol. 32)
G.M. Baudet , Department of Computer Science, Brown University
A family of VLSI circuits is presented to perform open convolution, i.e., polynomial multiplication. The circuits are all based on a recursive construction and are therefore particularly well adapted to automated design. All the circuits presented are optimal with respect to the area?time2 tradeoff, and, depending on the degree of paralleism or pipeline, they range from a compact but slow convolver to a large but very fast convolver.
VLSI design, Area-time optimality, convolution
F. Preparata, J. Vuillemin and G. Baudet, "Area?Time Optimal VLSI Circuits for Convolution," in IEEE Transactions on Computers, vol. 32, no. , pp. 684-688, 1983.