A new approach for Boolean function minimization

In this paper we present a new approach for Boolean function minimization. We introduce a new representation for sum of two terms that can be used to perform traditional Boolean minimization (ex. AB+AB~=A) as well as terms of the type ABC+A~B~C~. We call these terms as CTERMs. We introduce rules to combine CTERMS that would lead to new minimization algorithm. Since the minimization includes sum of products, EXOR, EXNOR and other complex terms, fewer terms are needed to represent a given Boolean function resulting in a near optimal representation. The minimization algorithm is implemented in PERL programming language.