Generalized polynomial forms of boolean functions and design of multi-output logical circuits

Generalized Polynomial forms of Boolean functions (sets of Boolean functions) are studied. Algorithms are proposed whereby the functions are represented as a polynomial form of the specified type. Various types of multi-output combinational logical circuits are considered that model the polynomial forms of sets of Boolean functions.