Generalized Matching : a new approach to concurrent logic optimization and library binding

In this work we describe a novel approach to the classical problem of library binding. We de ne the concept of generalized matching, a Boolean constraint whose satisfaction allows us to nd all possible input assignments for which a library element matches a given Boolean relation. Completely and incompletely speci ed Boolean functions are treated as particular cases. Generalized matching supports the simultaneous matching of more than one single-output cell (or the optimal use of multi-output cells) and allows the optimization of pin-assignment dependent cost functions. We describe a fully symbolic procedure for generalized matching, and we discuss the related e ciency issues. The advantages of generalized matching over traditional Boolean matching are then discussed by means of examples.

[1]  Giovanni De Micheli,et al.  Don't care set specifications in combinational and synchronous logic circuits , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[3]  Sharad Malik,et al.  Permutation and phase independent Boolean comparison , 1993, Integr..

[4]  Sharad Malik,et al.  Permutation and phase independent Boolean comparison , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[5]  Massoud Pedram,et al.  Boolean matching using binary decision diagrams with applications to logic synthesis and verification , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

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

[7]  M. Fujita,et al.  Boolean technology mapping for both ECI and CMOS circuits based on permissible functions and binary decision diagrams , 1990, Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[8]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

[9]  Ulf Schlichtmann,et al.  Characterization of Boolean functions for rapid matching in EPGA technology mapping , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[10]  Chi-Ying Tsui,et al.  Power efficient technology decomposition and mapping under an extended power consumption model , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  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.

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

[13]  K.-C. Chen,et al.  Boolean matching algorithms , 1993, 1993 International Symposium on VLSI Technology, Systems, and Applications Proceedings of Technical Papers.

[14]  Robert K. Brayton,et al.  Logic optimization with multi-output gates , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

[15]  Robert K. Brayton,et al.  Boolean matching in logic synthesis , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.

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

[17]  Giovanni De Micheli,et al.  Technology mapping using Boolean matching and don't care sets , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..