Efficient canonical form for Boolean matching of complex functions in large libraries

@article{Ciric2001EfficientCF,
  title={Efficient canonical form for Boolean matching of complex functions in large libraries},
  author={Jovanka Ciric and Carl Sechen},
  journal={IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281)},
  year={2001},
  pages={610-617}
}
A new algorithm is developed which transforms the truth table or implicant table of a Boolean function into a canonical form under any permutation of inputs. The algorithm is used for Boolean matching for large libraries that contain cells with large numbers of inputs and implicants. The minimum cost canonical form is used as a unique identifier for searching for the cell in the library. The search time is nearly constant if a hash table is used for storing the cells' canonical representations… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

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

References

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

Similar Papers

Loading similar papers…