A HEURISTIC ALGORITHM FOR BOOLEAN FACTORING

In this paper, an algorithm for Boolean factoring is presented. The al gorithm is based on a technique of rectangle covering. A distinctive f eature of the algorithm is that no minimization step is required to ac hieve Boolean factoring. The method for computing Boolean products res ts on the concepts of super-product, extended kernel and extended co-k ernel-cube matrix. Results of a comparison with the algorithms GOOD_FA CTOR and QUICK_FACTOR implemented in SIS are presented. SIS is a progr am for logic synthesis developed at the University of Berkeley. All pe rformed tests indicate that the proposed algorithm realizes a good tra deoff between factoring quality and computing time.