Boolean Matrix Equations in Digital Circuit Design

A systematic digital computational method is given that involves the use of Boolean matrix equations for solving certain types of functional circuit design problems. Specifically, all sets of Boolean functions f1(A1, . . ., A1), . . ., fJ(A1, - . . ., A1) are found such that if circuits with these outputs are connected to a circuit that generates the known Boolean function F(f1, . . . , fJ, X1, . . ., XK), then the output will produce a given desired function E(A1, . . ., A1, X1, . . ., XK). Illustrative examples of the method are presented.