GitHub

A collection of Python functions for creating MILP (Mixed Integer Linear Programming) problems the solution of which correspond to optimal combinational logic circuit designs.

Combinational logic circuits or switching circuits are idealized electrical circuits that model Boolean functions, that is, functions of the form $f:\{0,1\}^n\to\{0,1 ...
IEEE

Boolean Complement Method to Polynomial Codes for Combinational Circuits Testing

Abstract: The authors have proposed to use the Boolean complement method to polynomial codes for combinational circuits checking. The Boolean complement method is based all or part of the functions ...
IEEE

Algebraic Topological Methods for the Synthesis of Switching Systems—Part III: Minimization of Nonsingular Boolean Trees

Abstract: An algorithm is given for solving a general problem in combinational switching-circuit minimization theory. The circuits considered consist of a disjunction (OR-ing together) of trees of any ...