Boolean factoring with kernels and rectangle covering

C. Leonard Berman; Naotaka Maeda; Sharad Malik

Boolean factoring with kernels and rectangle covering

C. Leonard Berman, Naotaka Maeda, Sharad Malik

Research output: Contribution to journal › Conference article › peer-review

Abstract

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 language	English (US)
Pages (from-to)	2646-2649
Number of pages	4
Journal	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	4
State	Published - Dec 1 1990
Externally published	Yes
Event	1990 IEEE International Symposium on Circuits and Systems Part 4 (of 4) - New Orleans, LA, USA Duration: May 1 1990 → May 3 1990

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Cite this

@article{ec36c6b35fcf4f168db7fc9223955430,

title = "Boolean factoring with kernels and rectangle covering",

abstract = "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.",

author = "Berman, {C. Leonard} and Naotaka Maeda and Sharad Malik",

year = "1990",

month = dec,

day = "1",

language = "English (US)",

volume = "4",

pages = "2646--2649",

journal = "Proceedings - IEEE International Symposium on Circuits and Systems",

issn = "0271-4310",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "1990 IEEE International Symposium on Circuits and Systems Part 4 (of 4) ; Conference date: 01-05-1990 Through 03-05-1990",

}

TY - JOUR

T1 - Boolean factoring with kernels and rectangle covering

AU - Berman, C. Leonard

AU - Maeda, Naotaka

AU - Malik, Sharad

PY - 1990/12/1

Y1 - 1990/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025671631&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025671631&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0025671631

SN - 0271-4310

VL - 4

SP - 2646

EP - 2649

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

T2 - 1990 IEEE International Symposium on Circuits and Systems Part 4 (of 4)

Y2 - 1 May 1990 through 3 May 1990

ER -

Boolean factoring with kernels and rectangle covering

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this