An improved algorithm for Boolean factoring

This paper is concerned with an algorithm for Boolean factoring. In an earlier paper [1993], the author proposed a new algorithm for Boolean factoring that does not require any minimization step. The technique used for generating Boolean products rests on the notion of elementary rectangle. In this paper, we present two substantial improvements to this algorithm. The first is a new factoring strategy. The second is a new expansion technique. The modified algorithm outperforms the original one both in efficiency and quality of results.<<ETX>>

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

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

[3]  Giuseppe Caruso.  Near optimal factorization of Boolean functions , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Bo-Gwan Kim,et al.  Multilevel logic synthesis with extended arrays , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  G. Caruso.  Boolean factoring of logic functions , 1993, Proceedings of 36th Midwest Symposium on Circuits and Systems.

[6]  Robert K. Brayton,et al.  Multilevel logic synthesis , 1990, Proc. IEEE.