Efficient Canonical Form for Boolean Matching of Complex Functions in Large Libraries:
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 in the library.

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 in the library.

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.