Restructuring logic representations with easily detectable simple disjunctive decompositions

Hiroshi Sawada, Shigeru Yamashita, Akira Nagoya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

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
Title of host publicationProceedings -Design, Automation and Test in Europe, DATE
Pages755-759
Number of pages5
DOIs
Publication statusPublished - 1998
Externally publishedYes
EventDesign, Automation and Test in Europe, DATE 1998 - Paris, France
Duration: Feb 23 1998Feb 26 1998

Other

OtherDesign, Automation and Test in Europe, DATE 1998
CountryFrance
CityParis
Period2/23/982/26/98

Fingerprint

Decomposition
Logic circuits
Cones
Experiments

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Sawada, H., Yamashita, S., & Nagoya, A. (1998). Restructuring logic representations with easily detectable simple disjunctive decompositions. In Proceedings -Design, Automation and Test in Europe, DATE (pp. 755-759). [655943] https://doi.org/10.1109/DATE.1998.655943

Restructuring logic representations with easily detectable simple disjunctive decompositions. / Sawada, Hiroshi; Yamashita, Shigeru; Nagoya, Akira.

Proceedings -Design, Automation and Test in Europe, DATE. 1998. p. 755-759 655943.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sawada, H, Yamashita, S & Nagoya, A 1998, Restructuring logic representations with easily detectable simple disjunctive decompositions. in Proceedings -Design, Automation and Test in Europe, DATE., 655943, pp. 755-759, Design, Automation and Test in Europe, DATE 1998, Paris, France, 2/23/98. https://doi.org/10.1109/DATE.1998.655943
Sawada H, Yamashita S, Nagoya A. Restructuring logic representations with easily detectable simple disjunctive decompositions. In Proceedings -Design, Automation and Test in Europe, DATE. 1998. p. 755-759. 655943 https://doi.org/10.1109/DATE.1998.655943
Sawada, Hiroshi ; Yamashita, Shigeru ; Nagoya, Akira. / Restructuring logic representations with easily detectable simple disjunctive decompositions. Proceedings -Design, Automation and Test in Europe, DATE. 1998. pp. 755-759
@inproceedings{ee46a94c43da418abf1fe6ab93cf2c3e,
title = "Restructuring logic representations with easily detectable simple disjunctive decompositions",
abstract = "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.",
author = "Hiroshi Sawada and Shigeru Yamashita and Akira Nagoya",
year = "1998",
doi = "10.1109/DATE.1998.655943",
language = "English",
pages = "755--759",
booktitle = "Proceedings -Design, Automation and Test in Europe, DATE",

}

TY - GEN

T1 - Restructuring logic representations with easily detectable simple disjunctive decompositions

AU - Sawada, Hiroshi

AU - Yamashita, Shigeru

AU - Nagoya, Akira

PY - 1998

Y1 - 1998

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

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

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

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

U2 - 10.1109/DATE.1998.655943

DO - 10.1109/DATE.1998.655943

M3 - Conference contribution

SP - 755

EP - 759

BT - Proceedings -Design, Automation and Test in Europe, DATE

ER -