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 language | English |
|---|---|
| Title of host publication | Proceedings of the IEEE Great Lakes Symposium on VLSI |
| Editors | Anon |
| Publisher | IEEE |
| Pages | 39-44 |
| Number of pages | 6 |
| Publication status | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 7th Great Lakes Symposium on VLSI - Urbana-Champaign, IL, USA Duration: Mar 13 1997 → Mar 15 1997 |
Other
| Other | Proceedings of the 1997 7th Great Lakes Symposium on VLSI |
|---|---|
| City | Urbana-Champaign, IL, USA |
| Period | 3/13/97 → 3/15/97 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
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 proceeding › Conference contribution
}
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
AN - SCOPUS:0030644910
SP - 39
EP - 44
BT - Proceedings of the IEEE Great Lakes Symposium on VLSI
A2 - Anon, null
PB - IEEE
ER -