Fast Boolean matching with don't cares

This paper describes a fast Boolean matching algorithm which checks the containment relationship between an incompletely specified function and a completely specified function under permutation and negation on the input variables. The algorithm is designed for the pattern matching problem in technology mapping. It exploits functional symmetries of patterns and utilizes a compact data structure: binary permutation matrix. Using this matrix, nonmatching permutations and phase assignments can be pruned efficiently. All legal permutations and phase assignments, leading to a matching, can be obtained, as well. The experimental results on the MCNC benchmarks show that, compared with other Boolean matching approaches, our algorithm is at least 1,500 times faster for a common pattern abed + efgh and 58,000 times faster for another common pattern ab + cd + ef + gh. The matching speed for completely specified functions is also comparable to state-of-the-art matching algorithms

[1]  Sharad Malik,et al.  Technology Mapping for Low Power , 1993, DAC 1993.

[2]  L. Stok,et al.  Wavefront technology mapping , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[3]  Carl Sechen,et al.  Efficient canonical form for boolean matching of complex functions in large libraries , 2001, ICCAD 2001.

[4]  Sharad Malik,et al.  Technology Mapping for Low Power , 1993, 30th ACM/IEEE Design Automation Conference.

[5]  Jerry R. Burch,et al.  Efficient Boolean function matching , 1992, ICCAD.

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

[7]  Tsutomu Sasao,et al.  PAPER Special Section on VLSI Design and CAD Algorithms Fast Boolean Matching under Permutation by Efficient Computation of Canonical Form , 2004 .

[8]  Martin D. F. Wong,et al.  Fast Boolean matching for field-programmable gate arrays , 1993, Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference.

[9]  Sharad Malik,et al.  Limits of using signatures for permutation independent Boolean comparison , 1995, ASP-DAC '95.

[10]  TingTing Hwang,et al.  Boolean Matching for Incompletely Specified Functions , 1995, 32nd Design Automation Conference.

[11]  Massoud Pedram,et al.  A new canonical form for fast Boolean matching in logic synthesis and verification , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[12]  Jason Cong,et al.  Cut ranking and pruning: enabling a general and efficient FPGA mapping solution , 1999, FPGA '99.

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

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

[15]  B. Kapoor.  Improved technology mapping using a new approach to Boolean matching , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

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

[17]  Andreas Kuehlmann,et al.  Building a Better Boolean Matcher and Symmetry Detector , 2006, Proceedings of the Design Automation & Test in Europe Conference.

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

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

[20]  Daniela De Venuto,et al.  International Symposium on Quality Electronic Design , 2005, Microelectron. J..