Characterization of Boolean functions for rapid matching in EPGA technology mapping

Abstract

The authors introduce characteristic signatures for Boolean functions. The signatures do not exhibit sensitivity to permutations of input variables. These signatures are used to develop a method of rapidly matching subcircuits with cells in a large library. The procedure is analogous to hashing. Filters are discussed that were found to be useful in improving the matching of variables before applying the equivalence verification. Experimental results and the figure of merit of various signatures are outlined.<>