Restructuring logic representations with easily detectable simple disjunctive decompositions

Hiroshi Sawada, Shigeru Yamashita, Akira Nagoya

Research output: Contribution to journalConference articlepeer-review

9 Citations (Scopus)


Simple disjunctive decomposition is a special case of logic function decomposition, where variables are divided into two disjoint sets and there is only one newly introduced variable. This paper presents that many simple disjunctive decompositions can be found easily by detecting symmetric variables or checking variable cofactors. We also propose an algorithm that constructs a new logic representation for a simple disjunctive decomposition by assigning constant values to variables in the original representation. The algorithm enables us to apply the decomposition with keeping good structures of the original representation. We have performed experiments to restructure fanout free cones of multi-level logic circuits, and obtained better results than when not restructuring them.

Original languageEnglish
Article number655943
Pages (from-to)755-759
Number of pages5
JournalProceedings -Design, Automation and Test in Europe, DATE
Publication statusPublished - 1998
Externally publishedYes
EventDesign, Automation and Test in Europe, DATE 1998 - Paris, France
Duration: Feb 23 1998Feb 26 1998

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'Restructuring logic representations with easily detectable simple disjunctive decompositions'. Together they form a unique fingerprint.

Cite this