A Computer Program for the Synthesis of Switching Circuits by Decomposition

Abstract

A computer program, which has a Boolean expression and a functionally complete set of switching functions as input data and as output data, gives a description of a logic diagram that shows the synthesized switching circuit realizing the Boolean expression, is described in this paper. The program utilizes a new proof for a generalized version of a theorem that was first stated by Ashenhurst. It is shown that an implementation of a modified form of the decomposition chart technique is indeed useful for the synthesis of combinational switching circuits.