Abstract

We introduce new representations for Boolean functions which look like polynomials whose summands are operator images of odd functions. The obtained classes of canonical forms extend many of known classes, for example GRM and KRO. For classes of operator canonical forms which are called here heterogeneous, effective algorithms for finding coefficients are found. The new representations can be used for synthesis of quasi-minimum ESOP circuits.