A Complexity Theory for VLSI

The established methodologies for studying computational complexity can be applied to the new problems posed by very large-scale integrated (VLSI) circuits. This thesis develops a "VLSI model of computation" and derives upper and lower bounds on the silicon area and time required to solve the problems of sorting and discrete Fourier transformation. In particular, the area A and time T taken by any VLSI chip using any algorithm to perform an N-point Fourier transform must satisfy AT('2) (GREATERTHEQ) cN('2)log('2)N, for some fixed c > 0. A more general result for both sorting and Fourier transformation is that AT('2x) = (OMEGA)(N('1+x)log('2x)N), for any x in the range 0 (LESSTHEQ) x (LESSTHEQ) 1. Also, the energy dissipated by a VLSI chip during the solution of either of these problems is at least (OMEGA)(N('3/2)log N). The tightness of these bounds is demonstrated by the existence of nearly optimal circuits for both sorting and Fourier transformation. The circuits based on the shuffle-exchange interconnection pattern are fast but large: T = O(log('2)N) for Fourier transformation, T = O(log('3)N) for sorting; both have area A of at most O(N('2)/log('1/2)N). The circuits based on the mesh interconnection pattern are slow but small: T = O(N('1/2)loglog N), A = O(N log('2)N).

[1]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[2]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[3]  Marshall C. Pease,et al.  An Adaptation of the Fast Fourier Transform for Parallel Processing , 1968, JACM.

[4]  Carl Hewitt,et al.  Comparative Schematology , 1970 .

[5]  Alan R. Jones,et al.  Fast Fourier Transform , 1970, SIGP.

[6]  Peter J. Nicholson,et al.  Algebraic Theory of Finite Fourier Transforms , 1971, Journal of computer and system sciences (Print).

[7]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[8]  James E. Stevens,et al.  A fast fourier transform subroutine for ILLIAC IV , 1971 .

[9]  Robert W. Floyd,et al.  Permuting Information in Idealized Two-Level Storage , 1972, Complexity of Computer Computations.

[10]  Ivan E. Sutherland,et al.  How Big Should a Printed Circuit Board Be? , 1973, IEEE Transactions on Computers.

[11]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[12]  David S. Johnson,et al.  Some simplified polynomial complete problems , 1974 .

[13]  C. Burrus,et al.  Number theoretic transforms to implement fast digital convolution , 1975, Proceedings of the IEEE.

[14]  C. Burrus,et al.  Number theoretic transforms to implement fast digital convolution , 1975 .

[15]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1976, STOC '76.

[16]  S. Winograd.  On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[17]  Leslie G. Valiant,et al.  Graph-Theoretic Properties in computational Complexity , 1976, J. Comput. Syst. Sci..

[18]  Robert E. Tarjan,et al.  Application of a Planar Separator Theorem , 1977, FOCS.

[19]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[20]  Martin Tompa,et al.  Time-space tradeoffs for computing functions, using connectivity properties of their circuits , 1978, J. Comput. Syst. Sci..

[21]  Yossi Shiloach,et al.  Permutation layout , 1978, Networks.

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

[23]  Harold Abelson,et al.  Lower bounds on information transfer in distributed computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[24]  Dave Johannsen.  Hierarchical power routing , 1978 .

[25]  John E. Savage,et al.  Space-Time Tradeoffs for Oblivious Interger Multiplications , 1979, ICALP.

[26]  A.M. Mohsen,et al.  Delay-time optimization for driving and sensing of signals on high-capacitance paths of VLSI systems , 1979, IEEE Transactions on Electron Devices.

[27]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[28]  Hans P. Moravec.  Fully Interconnecting Multiple Computers with Pipelined Sorting Nets , 1979, IEEE Transactions on Computers.

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

[30]  S.A. Evans,et al.  Scaling I2L for VLSI , 1979, IEEE Transactions on Electron Devices.

[31]  Charles L. Seitz,et al.  Self-Timed VLSI Systems , 1979 .

[32]  S. Wagstaff.  Greatest of the least primes in arithmetic progressions having a given modulus , 1979 .

[33]  William E. Donath,et al.  Placement and average interconnection lengths of computer logic , 1979 .

[34]  M. Rem,et al.  Cost and performance of VLSI computing structures , 1979, IEEE Transactions on Electron Devices.

[35]  Charles E. Leiserson,et al.  A Layout for the Shuffle-Exchange Network. , 1980 .

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

[37]  Charles E. Leiserson,et al.  Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.

[38]  D. Grigor'ev.  Application of separability and independence notions for proving lower bounds of circuit complexity , 1980 .

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

[40]  H. T. Kung,et al.  The Area-Time Complexity of Binary Multiplication , 1981, JACM.

[41]  Paul R. Thompson.  AUTHOR! , 1982, The Lancet.