Exploiting communication complexity for multilevel logic synthesis

A multilevel logic synthesis technique based on minimizing communication complexity is presented. This approach is believed to be viable because, for many types of circuits, the area needed is dominated by interconnections. By minimizing communication complexity and interconnect, area is reduced. This approach performs especially well for functions that are hierarchically decomposable (e.g., adders, parity generators, comparators, etc.). Unlike many other multilevel logic synthesis techniques, a lower bound can be computed to determine how well the synthesis was performed. A new multilevel logic synthesis program based on the techniques described for reducing communication complexity is presented. >

[1]  Robert K. Brayton,et al.  MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  R. Karp.  Functional Decomposition and Switching Circuit Design , 1963 .

[3]  D. Gregory,et al.  SOCRATES: A System for Automatically Synthesizing and Optimizing Combinational Logic , 1986, 23rd ACM/IEEE Design Automation Conference.

[4]  Zvi Galil,et al.  Lower Bounds on Communication Complexity , 1987, Inf. Comput..

[5]  H. Allen Curtis.  A Generalized Tree Circuit , 1961, JACM.

[6]  Andrew Chi-Chih Yao,et al.  The entropic limitations on VLSI computations(Extended Abstract) , 1981, STOC '81.

[7]  Wayne H. Wolf,et al.  Experiments in logic optimization , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[8]  Tsutomu Sasao.  Application of multiple-valued logic to a serial decomposition of PLAs , 1989, Proceedings. The Nineteenth International Symposium on Multiple-Valued Logic.

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

[10]  Louise Trevillyan,et al.  Logic Synthesis Through Local Transformations , 1981, IBM J. Res. Dev..

[11]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[12]  Mary Jane Irwin,et al.  A Comparison of Four Two-Dimensional Gate Matrix Layout Tools , 1989, 26th ACM/IEEE Design Automation Conference.

[13]  Mary Jane Irwin,et al.  Mesh Arrays and Logician: A Tool for Their Efficient Generation , 1987, 24th ACM/IEEE Design Automation Conference.

[14]  H. A. Curtis,et al.  A new approach to The design of switching circuits , 1962 .

[15]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[16]  Gary D. Hachtel,et al.  BOLD: The Boulder Optimal Logic Design system , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume 1: Architecture Track.

[17]  Mary Jane Irwin,et al.  An Overview of the Penn State Design System , 1987, 24th ACM/IEEE Design Automation Conference.