Efficient computation of canonical form for boolean matching in large libraries

@article{Debnath2004EfficientCO,
  title={Efficient computation of canonical form for boolean matching in large libraries},
  author={Debatosh Debnath and Tsutomu Sasao},
  journal={ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)},
  year={2004},
  pages={591-596}
}
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… CONTINUE READING
Highly Cited
This paper has 36 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…