Efficient Computation of Canonical Form for Boolean Matching in Large Libraries (2004)
| Venue: | in Asia and South Pacific Design Automation Conference |
| Citations: | 5 - 0 self |
BibTeX
@INPROCEEDINGS{Debnath04efficientcomputation,
author = {Debatosh Debnath and Tsutomu Sasao},
title = {Efficient Computation of Canonical Form for Boolean Matching in Large Libraries},
booktitle = {in Asia and South Pacific Design Automation Conference},
year = {2004},
pages = {591--596}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 breadthfirst 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.
