This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers
February 1983 (vol. 32 no. 2)
pp. 194-198
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(N2) lower bound to the area ? (time)2measure of complexity in the VLSI model of computation. The network, which is based on the discrete Fourier transform, has a
Index Terms:
VLSI computation, DFT, integer multiplication, mesh networks, optimal networks, parallel processing
Citation:
F.P. Preparata, "A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers," IEEE Transactions on Computers, vol. 32, no. 2, pp. 194-198, Feb. 1983, doi:10.1109/TC.1983.1676203
Usage of this product signifies your acceptance of the Terms of Use.