Abstract
In this article, we have shown, by means of the EXOR Ternary Decision Diagram that the number of literals and product terms of the Fixed Polarity Reed–Muller (FPRM) expansions can be used to fully classify all Boolean functions in NP equivalent class and NPN equivalent class, respectively. Efficient graph based algorithms to compute the complete weight vectors have been presented. The proof and computation method has led to the derivation of a set of characteristic signatures that has low probability of aliasing when used as the Boolean matching filters in library mapping.