The VLSI complexity of Boolean functions
It is well-known that all Boolean functions of n variables can be computed by a logic circuit with O(2n/n) gates (Lupanov's theorem) and that there exist Boolean functions of n variables which require logic circuits of this size (Shannon's theorem). We present corresponding results for Boolean functions computed by VLSI circuits, using Thompson's model of a VLSI chip. We prove that all Boolean functions of n variables can be computed by a VLSI circuit of O(2n) area and period 1, and we prove that there exist Boolean functions of n variables for which every (convex) VLSI chip must have Ω(2n) area.
Keywords and phraseslogic circuit Boolean function Lupanov's theorem Shannon's theorem VLSI chip area period
Unable to display preview. Download preview PDF.
- Brent, R.P. and H.T. Kung, The area-time complexity of binary multiplication, J.ACM 28 (1981) 521–534.Google Scholar
- Lupanov, O.B., A method of circuit synthesis, Izv. V.U.Z. Radiofiz. 1 (1958) 120–140.Google Scholar
- Mead, C.A. and L.A. Conway, Introduction to VLSI systems, Addison-Wesley, Reading, Mass., 1980.Google Scholar
- Mead, C.A. and M. Rem, Cost and performance of VLSI computing structures, IEEE J. Solid State Circuits SC-14 (1979) 455–462.Google Scholar
- Savage, J.E., The complexity of computing, John Wiley & Sons, New York, N.Y., 1976.Google Scholar
- Shannon, C.E., The synthesis of two-terminal switching circuits, Bell Syst. Techn. J. 28 (1949) 59–98.Google Scholar
- Thompson, C.D., A complexity theory for VLSI, (Ph.D. Thesis), Techn. Rep. CMU-CS-80-140, Dept. of Computer Science, Carnegie-Mellon University, Pittsburgh, P.A., 1980.Google Scholar
- Yaglom, A.M. and I.M. Yaglom, Challenging mathematical problems with elementary solutions, Holden-Day, San Francisco, CA., 1967.Google Scholar