DAGON: technology binding and local optimization by DAG matching
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Boolean matching in logic synthesis
EURO-DAC '92 Proceedings of the conference on European design automation
Surveys in combinatorics, 1993
Surveys in combinatorics, 1993
Permutation and phase independent Boolean comparison
Integration, the VLSI Journal
Boolean matching for incompletely specified functions
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
A survey of Boolean matching techniques for library binding
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Cut ranking and pruning: enabling a general and efficient FPGA mapping solution
FPGA '99 Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays
Efficient Boolean function matching
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
DATE '99 Proceedings of the conference on Design, automation and test in Europe
Efficient canonical form for boolean matching of complex functions in large libraries
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Limits of Using Signatures for Permutation Independent Boolean Comparison
Formal Methods in System Design
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Improved technology mapping using a new approach to Boolean matching
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Technology mapping using boolean matching and don't care sets
EURO-DAC '90 Proceedings of the conference on European design automation
A new canonical form for fast boolean matching in logic synthesis and verification
Proceedings of the 42nd annual Design Automation Conference
Building a better Boolean matcher and symmetry detector
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Exploiting symmetry in SAT-based Boolean matching for heterogeneous FPGA technology mapping
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Signature based Boolean matching in the presence of don't cares
Proceedings of the 45th annual Design Automation Conference
BooM: a decision procedure for boolean matching with abstraction and dynamic learning
Proceedings of the 47th Design Automation Conference
Boolean matching of function vectors with strengthened learning
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
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 abcd + 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-ofthe- art matching algorithms.