Efficient computation of canonical form for boolean matching in large libraries

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 hasis of the Boolean matching, we use the notion NP-representative (NI'R); two functions have the same NPR if one can he obtained from the other hy a permutation andlor complementation(s) of the variables. By using a table look-up and a tree-based hreadthfirst 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 Hinsherger-Kolla's algorithm-the fastest Boolean matching algorithm for large libraries.