This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Combinatorial Limit to the Computing Power of VLSI Circuits
March 1983 (vol. 32 no. 3)
pp. 294-300
J. Vuillemin, INRIA
We introduce a property of Boolean functions, called transitivity which consists of integer, polynomial, and matrix products as well as of many interesting related computational problems. We show that the area of any circuit computing a transitive function grows quadratically with the circuit's maximum data rate, expressed in bits/S. This result provides a precise analytic expression of an area-time tradeoff for a wide class of VLSI circuits. Furthermore (as shown elsewhere), this tradeoff is achievable. We have thus matching (to within a constant multiplicative factor) upper and lower complexity bounds for the three above products, in the VLSI circuits computational model.
Index Terms:
VLSI computations, Area-time tradeoff, computation models, lower bounds, transitive Boolean functions
Citation:
J. Vuillemin, "A Combinatorial Limit to the Computing Power of VLSI Circuits," IEEE Transactions on Computers, vol. 32, no. 3, pp. 294-300, March 1983, doi:10.1109/TC.1983.1676221
Usage of this product signifies your acceptance of the Terms of Use.