Near optimal factorization of Boolean functions

An algorithm for algebraic factorization of single-output functions is presented. The algorithm is based on the generation of some products covering a set of true cubes suitably chosen. The products forming a near-optimal factored expression are locally chosen from the ones covering each of those cubes. In order to obtain a good factorization, heuristics are used in the three procedures of which the method is composed. The algorithm is compared to a QUICK-FACTOR-like algorithm, using a large set of randomly generated functions. and it provides good results. >

[1]  William W. Cohen,et al.  Synthesis and Optimization of Multilevel Logic under Timing Constraints , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Robert K. Brayton,et al.  MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  R. Brayton Factoring logic functions , 1987 .

[4]  Giuseppe Caruso A Local Selection Algorithm for Switching Function Minimization , 1984, IEEE Transactions on Computers.

[5]  Utz G. Baitinger,et al.  CARLOS: an automated multilevel logic design system for CMOS semi-custom integrated circuits , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Donald L. Dietmeyer,et al.  Logic Design Automation of Fan-In Limited NAND Networks , 1969, IEEE Transactions on Computers.

[7]  Tsutomu Sasao MACDAS: Multi-level AND-OR Circuit Synthesis Using Two-Variable Function Generators , 1986, DAC 1986.