Restricted simple disjunctive decompositions based on grouping symmetric variables

Hiroshi Sawada, Shigeru Yamashita, Akira Nagoya

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

5 Citations (Scopus)

Abstract

This paper presents an efficient method for a simple disjunctive decomposition, where candidates for the bound set are restricted to sets of symmetric variables to reduce the computation cost. Symmetric variables are detected by depth-first traversals of an ordered binary decision diagram (OBDD), and decompositions are carried out by changing the variable order of the OBDD. We do not change the variable order until the change is really needed. Experimental results show that even if the decomposition form was restricted, many practical functions could be decomposed. The execution time for decomposition was very small even for functions with many variables. Combined with an exhaustive search, the method successfully decomposed some functions that could not be decomposed by exhaustive search alone in a practical amount of time.

Original languageEnglish
Title of host publicationProceedings of the IEEE Great Lakes Symposium on VLSI
Editors Anon
PublisherIEEE
Pages39-44
Number of pages6
Publication statusPublished - 1997
Externally publishedYes
EventProceedings of the 1997 7th Great Lakes Symposium on VLSI - Urbana-Champaign, IL, USA
Duration: Mar 13 1997Mar 15 1997

Other

OtherProceedings of the 1997 7th Great Lakes Symposium on VLSI
CityUrbana-Champaign, IL, USA
Period3/13/973/15/97

Fingerprint

Decomposition
Binary decision diagrams
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Sawada, H., Yamashita, S., & Nagoya, A. (1997). Restricted simple disjunctive decompositions based on grouping symmetric variables. In Anon (Ed.), Proceedings of the IEEE Great Lakes Symposium on VLSI (pp. 39-44). IEEE.

Restricted simple disjunctive decompositions based on grouping symmetric variables. / Sawada, Hiroshi; Yamashita, Shigeru; Nagoya, Akira.

Proceedings of the IEEE Great Lakes Symposium on VLSI. ed. / Anon. IEEE, 1997. p. 39-44.

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

Sawada, H, Yamashita, S & Nagoya, A 1997, Restricted simple disjunctive decompositions based on grouping symmetric variables. in Anon (ed.), Proceedings of the IEEE Great Lakes Symposium on VLSI. IEEE, pp. 39-44, Proceedings of the 1997 7th Great Lakes Symposium on VLSI, Urbana-Champaign, IL, USA, 3/13/97.
Sawada H, Yamashita S, Nagoya A. Restricted simple disjunctive decompositions based on grouping symmetric variables. In Anon, editor, Proceedings of the IEEE Great Lakes Symposium on VLSI. IEEE. 1997. p. 39-44
Sawada, Hiroshi ; Yamashita, Shigeru ; Nagoya, Akira. / Restricted simple disjunctive decompositions based on grouping symmetric variables. Proceedings of the IEEE Great Lakes Symposium on VLSI. editor / Anon. IEEE, 1997. pp. 39-44
@inproceedings{75db735ab1284f21adae3b99360b5cbe,
title = "Restricted simple disjunctive decompositions based on grouping symmetric variables",
abstract = "This paper presents an efficient method for a simple disjunctive decomposition, where candidates for the bound set are restricted to sets of symmetric variables to reduce the computation cost. Symmetric variables are detected by depth-first traversals of an ordered binary decision diagram (OBDD), and decompositions are carried out by changing the variable order of the OBDD. We do not change the variable order until the change is really needed. Experimental results show that even if the decomposition form was restricted, many practical functions could be decomposed. The execution time for decomposition was very small even for functions with many variables. Combined with an exhaustive search, the method successfully decomposed some functions that could not be decomposed by exhaustive search alone in a practical amount of time.",
author = "Hiroshi Sawada and Shigeru Yamashita and Akira Nagoya",
year = "1997",
language = "English",
pages = "39--44",
editor = "Anon",
booktitle = "Proceedings of the IEEE Great Lakes Symposium on VLSI",
publisher = "IEEE",

}

TY - GEN

T1 - Restricted simple disjunctive decompositions based on grouping symmetric variables

AU - Sawada, Hiroshi

AU - Yamashita, Shigeru

AU - Nagoya, Akira

PY - 1997

Y1 - 1997

N2 - This paper presents an efficient method for a simple disjunctive decomposition, where candidates for the bound set are restricted to sets of symmetric variables to reduce the computation cost. Symmetric variables are detected by depth-first traversals of an ordered binary decision diagram (OBDD), and decompositions are carried out by changing the variable order of the OBDD. We do not change the variable order until the change is really needed. Experimental results show that even if the decomposition form was restricted, many practical functions could be decomposed. The execution time for decomposition was very small even for functions with many variables. Combined with an exhaustive search, the method successfully decomposed some functions that could not be decomposed by exhaustive search alone in a practical amount of time.

AB - This paper presents an efficient method for a simple disjunctive decomposition, where candidates for the bound set are restricted to sets of symmetric variables to reduce the computation cost. Symmetric variables are detected by depth-first traversals of an ordered binary decision diagram (OBDD), and decompositions are carried out by changing the variable order of the OBDD. We do not change the variable order until the change is really needed. Experimental results show that even if the decomposition form was restricted, many practical functions could be decomposed. The execution time for decomposition was very small even for functions with many variables. Combined with an exhaustive search, the method successfully decomposed some functions that could not be decomposed by exhaustive search alone in a practical amount of time.

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

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

M3 - Conference contribution

SP - 39

EP - 44

BT - Proceedings of the IEEE Great Lakes Symposium on VLSI

A2 - Anon, null

PB - IEEE

ER -