Issue No. 02 - February (1983 vol. 32)
F.P. Preparata , Coordinated Science Laboratory and the Departments of Electrical Engineering and Computer Science, University of Illinois
This paper describes a VLSI network for the multiplication of two N-bit integers, for very large N. The network, with its area 0(N) and operation time 0(vN), matches, within a constant factor, the known theoretical O(N<sup>2</sup>) lower bound to the area ? (time)<sup>2</sup>measure of complexity in the VLSI model of computation. The network, which is based on the discrete Fourier transform, has a
VLSI computation, DFT, integer multiplication, mesh networks, optimal networks, parallel processing
F. Preparata, "A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers," in IEEE Transactions on Computers, vol. 32, no. , pp. 194-198, 1983.