The entropic limitations on VLSI computations(Extended Abstract)

In this paper we will explore the limitations imposed by entropic constraints, both in generality and for specific problems. We list below the main questions that we will address. (1) In the binary number system, addition is easy while multiplication is hard for VLSI. Is there an “ideal” number representation, in which all arithmetic operations have efficient VLSI implementations? (2) Can one build multipliers for binary numbers, which achieve both small area and fast average computation time? (3) Thompson's technique applies only to multiple output functions. How can one prove area-time bounds for single output functions? (4) What other ways are there for deriving entropic constraints from consideration of data movement? Answers to these questions will be discussed in the ensuing sections.

[1]  Shmuel Winograd,et al.  On the Time Required to Perform Multiplication , 1967, JACM.

[2]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[3]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[4]  Richard J. Lipton,et al.  Space and Time Hierarchies for Classes of Control Structures and Data Structures , 1976, JACM.

[5]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[6]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .

[7]  H. T. Kung,et al.  Direct VLSI Implementation of Combinatorial Algorithms , 1979 .

[8]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[9]  C. Thomborson,et al.  Area-time complexity for VLSI , 1979, STOC.

[10]  Jean Vuillemin,et al.  A combinatorial limit to the computing power of V.L.S.I. circuits , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[11]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[12]  H. T. Kung,et al.  The chip complexity of binary arithmetic , 1980, STOC '80.

[13]  Harold Abelson,et al.  Information transfer and area-time tradeoffs for VLSI multiplication , 1980, CACM.

[14]  H. T. Kung,et al.  On the Area of Binary Tree Layouts , 1980, Inf. Process. Lett..

[15]  John E. Savage,et al.  Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models , 1981, J. Comput. Syst. Sci..

[16]  Richard P. Brent,et al.  Some Area-Time Tradeoffs for VLSI , 1982, SIAM J. Comput..