Generalized matching from theory to application

We present a novel approach for post-mapping optimization. We exploit the concept of generalised matching, a technique that finds symbolically all possible matching assignments of library cells to a multi-output network specified by a Boolean relation. Several objectives are targeted: area minimization under delay constraints; power minimization under delay constraints; and unconstrained delay minimization. We describe the theory of generalized matching and the algorithmic optimization required for its efficient and robust implementation. A tool based on generalized matching has been implemented and tested on large examples of the MCNC'91 benchmark suite. We obtain sizable improvements in: speed (6% in average, up to 20.7%); area under speed constraints (13.7% an average, up to 29.5%); and power under speed constraints (22.3% in average, up to 38.1%).

[1]  Kurt Keutzer.  DAGON: Technology Binding and Local Optimization by DAG Matching , 1987, DAC.

[2]  Premachandran R. Menon,et al.  Multi-level Logic Optimization By Implication Analysis , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[3]  Robert K. Brayton,et al.  Minimization of Boolean relations , 1989, IEEE International Symposium on Circuits and Systems,.

[4]  Robert K. Brayton,et al.  Multilevel logic synthesis , 1990, Proc. IEEE.

[5]  Luca Benini,et al.  Re-mapping for low power under tight timing constraints , 1997, Proceedings of 1997 International Symposium on Low Power Electronics and Design.

[6]  Giovanni De Micheli,et al.  Synthesis and Optimization of Digital Circuits , 1994 .

[7]  Malgorzata Marek-Sadowska,et al.  Fast Boolean optimization by rewiring , 1996, Proceedings of International Conference on Computer Aided Design.

[8]  S. Yang,et al.  Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .

[9]  Kwang-Ting Cheng,et al.  Multi-level logic optimization by redundancy addition and removal , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[10]  Robert K. Brayton,et al.  Extracting local don't cares for network optimization , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[11]  R. I. Bahar,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[12]  Robert K. Brayton,et al.  Permissible functions for multioutput components in combinational logic optimization , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Robert K. Brayton,et al.  Sequential circuit design using synthesis and optimization , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[14]  Luca Benini,et al.  A survey of Boolean matching techniques for library binding , 1997, TODE.

[15]  Kurt Antreich,et al.  Logic Clause Analysis for Delay Optimization , 1995, 32nd Design Automation Conference.