Factoring logic functions using graph partitioning

Abstract

Presented in this paper is the result of the investigation of algorithmic method use for factoring that uses graph partitioning rather that division. The method is a generalization of techniques for the so called read once functions which uses a special classes of Boolena functions, to devise new combinatorial algorithms for logic minimization. This method has been implemented in the SIS environment, and an empirical evaluation indicates that usually better results are produce rather than algebraic factoring and this method is quite competitive with Boolean factoring but with lower computation costs.