Factoring logic functions using graph partitioning

Martin C. Golumbic; Aviad Mintz

Factoring logic functions using graph partitioning

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

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.

Original language	English
Pages (from-to)	195-198
Number of pages	4
Journal	IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers
State	Published - 1999
Externally published	Yes
Event	Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design (ICCAD-99) - San Jose, CA, USA Duration: 7 Nov 1999 → 11 Nov 1999

ASJC Scopus subject areas

Software
Computer Science Applications
Computer Graphics and Computer-Aided Design

Cite this

@article{de2bfcbac4b042938405f5e891d73c5a,

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

author = "Golumbic, {Martin C.} and Aviad Mintz",

year = "1999",

language = "English",

pages = "195--198",

journal = "IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers",

issn = "1092-3152",

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

note = "Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design (ICCAD-99) ; Conference date: 07-11-1999 Through 11-11-1999",

}

TY - JOUR

T1 - Factoring logic functions using graph partitioning

AU - Golumbic, Martin C.

AU - Mintz, Aviad

PY - 1999

Y1 - 1999

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

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

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

M3 - Conference article

AN - SCOPUS:0033347266

SN - 1092-3152

SP - 195

EP - 198

JO - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

JF - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

T2 - Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design (ICCAD-99)

Y2 - 7 November 1999 through 11 November 1999

ER -

Factoring logic functions using graph partitioning

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this