Abstract
A technique is developed and used to derive lower bounds on the area required by a VLSI circuit by taking into account the amount of information that has to be memorized in the course of the computation. Simple arguments show, in particular, that any circuit performing operations such as cyclic shift and binary multiplication requires an area at least proportional to its output size. By extending the technique, it is also possible to obtain general tradeoffs between the area, the time, and the period (a measure of the pipeline rate) of a circuit performing operations like binary addition. The existence of VLSI designs for these operations shows that all the lower bounds are optimal up to some constant factor.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abelson,H. and P. Andreae. Information transfer and area-time for VLSI multiplication. CACM, Vol.23, No.l, 1980, pp. 20–23.
Brent,R.P. and H.T. Kung. The chip complexity of binary arithmetic. 12th Annual ACM Symposium on Theory of Computing, 1980,pp. 190–200.
Chazelle,B. and L. Monier. A model of computation for VLSI with related complexity results. 13th Annual ACM Symposium on Theory of Computing, 1981, pp. 318–325.
Hong,J.-W. and H.T. Kung. 1/0 complexity : The red-blue pebble game. 13th Annual ACM Symposium on Theory of Computing, 1981, pp. 326–333.
Johnson,R.B.,Jr . The complexity of a VLSI adder, IPL, Vol. 11, No. 2, 1980, pp. 92–93.
Ladner,R.E. and M.J. Fisher. Parallel prefix computation. International Conference on Parallel Processing, 1977, pp. 218–223.
Mead,C.A. and L.A. Conway. Introduction to VLSI systems. Addison- Wesley, 1980.
Savage,J.E . Area-time tradeoffs for matrix multiplication and related problems in VLSI models. Brown University, CS-50, 1979.
Thompson,C.D . Area-time complexity for VLSI. 11th Annual ACM Symposium on Theory of Computing, 1979, pp. 81–88.
Vuillemin,J.E . A combinatorial limit to the computing power of VLSI circuits. 21st Annual Symposium on Foundations of Computer Science, 1980, pp. 294–300.
Yao,A.C . The entropic limitations on VLSI computations. 13th Annual ACM Symposium on Theory of Computing, 1981, pp. 308–311.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Carnegie-Mellon University
About this chapter
Cite this chapter
Baudet, G.M. (1981). On the Area Required by VLSI Circuits. In: Kung, H.T., Sproull, B., Steele, G. (eds) VLSI Systems and Computations. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68402-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-68402-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-68404-3
Online ISBN: 978-3-642-68402-9
eBook Packages: Springer Book Archive