Simplification of Boolean function based on simplification rules

Abstract

Boolean function simplification is the art of exploiting simplification opportunities that exist inherently in logical structures by using the identities that exist within that algebra or reducing the number of roots in separate equations that, in its turn, leads to decreasing the number of variables in a considered system, the number of equations and time complexity. This paper studies the definition, characteristics and implementation of a minimization algorithm originally presented by Fiser and Hlavieka (2000). It is suitable for Boolean functions, whose values are defined only for a small part of their range. They were programmed in C++ and extensive experimental results, which were conducted with a set of standard LGSynth93 benchmarks, are discussed.