Boolean factoring with kernels and rectangle covering

C. Leonard Berman, Naotaka Maeda, Sharad Malik

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations


A technique for factoring Boolean expressions which extends standard factorization algorithms by utilizing Boolean and topological information directly during the factorization process is presented. A representation for Boolean functions is introduced, and efficient algorithms for constructing this representation are given. Examples of the techniques are given, and the results of experiments using these methods to factor functions from the MCNC logic synthesis benchmark set are reported. Preliminary experimental results show improvements of up to 20% in literal count compared to MISII algebraic factoring.

Original languageEnglish (US)
Pages (from-to)2646-2649
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
StatePublished - Dec 1 1990
Externally publishedYes
Event1990 IEEE International Symposium on Circuits and Systems Part 4 (of 4) - New Orleans, LA, USA
Duration: May 1 1990May 3 1990

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering


Dive into the research topics of 'Boolean factoring with kernels and rectangle covering'. Together they form a unique fingerprint.

Cite this