Issue No. 02 - February (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.565592
<p><b>Abstract</b>—In this paper, we present a new method to characterize completely specified Boolean functions. The central theme of the classification is the functional equivalence (a.k.a. Boolean matching). Two Boolean functions are equivalent if there exists input permutation, input negation, or output negation that can transform one function to the other. We have derived a method that can efficiently identify equivalence classes of Boolean functions. The well-known canonical Fixed Polarity Reed-Muller (FPRM) forms are used as a powerful analysis tool. The necessary transformations to derive one function from the other are inherent in the FPRM representations. To identify uniquely each equivalence class, a set of well-known characteristics of Boolean functions and their variables (including linearity, symmetry, total symmetry, self-complement, and self-duality) are employed. It is shown that all the equivalence classes of four-variable functions [<ref rid="bibt017310" type="bib">10</ref>] are uniquely identified where majority of the classes have a single FPRM form as their representative. The Boolean matching has applications in technology mapping and in design of standard cell libraries.</p>
Fixed polarity Reed-Muller form, Boolean function equivalence, self-complementary, self-dual, symmetry, linear variables.
"Boolean Functions Classification via Fixed Polarity Reed-Muller Forms", IEEE Transactions on Computers, vol. 46, no. , pp. 173-186, February 1997, doi:10.1109/12.565592