Algorithms for logical design

A series of ¿extraction algorithms¿ are presented that are applicable to the design of a wide class of combinational circuits. A special operation, the #-product, is introduced for carrying out these algorithms. Complete algorithms for the design of minimal and near-minimal 2-level AND-OR circuits are given, utilizing the extraction algorithms and the #-product. (These algorithms have been programmed for the International Business Machines Corporation (IBM) 704 and are available through the SHARE Library. Data are shown on the usage of these programs by IBM circuit designers.) Indication is also given as to how the extraction algorithms may be applied to a broader class of problems, namely to the design of disjunctions of nonsingular circuits.