Library based technology mapping using multiple domain representations

The use of signatures as efficient filters in Boolean matching is a crucial step in technology mapping and/or formal verification. In this work we combine well known representations of Boolean functions, the binary decision diagrams with those in the spectral domain, the functional decision diagrams and the equivalence decision diagrams. We obtain signatures of Boolean functions and their variables, which are easy to compute but can reduce the problem of aliases though