Technology mapping for electrically programmable gate arrays
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Characterization of Boolean functions for rapid matching in FPGA technology mapping
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Combined spectral techniques for Boolean matching
Proceedings of the 1996 ACM fourth international symposium on Field-programmable gate arrays
Boolean Functions Classification via Fixed Polarity Reed-Muller Forms
IEEE Transactions on Computers
A survey of Boolean matching techniques for library binding
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Boolean matching for large libraries
DAC '98 Proceedings of the 35th annual Design Automation Conference
Efficient Boolean function matching
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Logic Design and Switching Theory
Logic Design and Switching Theory
Synthesis and Optimization of Digital Circuits
Synthesis and Optimization of Digital Circuits
Spectral Techniques in Digital Logic
Spectral Techniques in Digital Logic
Spectral Transforms for Large Boolean Functions withApplications to Technology Mapping
Formal Methods in System Design
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Efficent Boolean Matching Algorithm for Cell Libraries
ICCS '94 Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors
Exploiting communication complexity for Boolean matching
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Efficient canonical form for Boolean matching of complex functions in large libraries
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
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
A unified approach to canonical form-based Boolean matching
Proceedings of the 44th annual Design Automation Conference
Signature based Boolean matching in the presence of don't cares
Proceedings of the 45th annual Design Automation Conference
Boolean factoring and decomposition of logic networks
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
A transform-parametric approach to Boolean matching
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.01 |
This paper presents an efficient technique for solving a Boolean matching problem in cell-library binding, where the number of cells in the library is large. As a basis of the Boolean matching, we use the notion NP-representative (NPR); two functions have the same NPR if one can be obtained from the other by a permutation and/or complementation(s) of the variables. By using a table look-up and a tree-based breadth-first search strategy, our method quickly computes NPR for a given function. Boolean matching of the given function against the whole library is determined by checking the presence of its NPR in a hash table, which stores NPRs for all the library functions and their complements. The effectiveness of our method is demonstrated through experimental results, which shows that it is more than two orders of magnitude faster than the Hinsberger-Kolla's algorithm---the fastest Boolean matching algorithm for large libraries.