IEICE TRANSACTIONS on Fundamentals
Bi-Partition of Shared Binary Decision Diagrams
Summary :
A shared binary decision diagram (SBDD) represents a multiple-output function, where nodes are shared among BDDs representing the various outputs. A partitioned SBDD consists of two or more SBDDs that share nodes. The separate SBDDs are optimized independently, often resulting in a reduction in the number of nodes over a single SBDD. We show a method for partitioning a single SBDD into two parts that reduces the node count. Among the benchmark functions tested, a node reduction of up to 23% is realized.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.12 pp.2693-2700
- Publication Date
- 2002/12/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
- Category
- Logic Synthesis
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Munehiro MATSUURA, Tsutomu SASAO, Jon T. BUTLER, Yukihiro IGUCHI, "Bi-Partition of Shared Binary Decision Diagrams" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 12, pp. 2693-2700, December 2002, doi: .
Abstract: A shared binary decision diagram (SBDD) represents a multiple-output function, where nodes are shared among BDDs representing the various outputs. A partitioned SBDD consists of two or more SBDDs that share nodes. The separate SBDDs are optimized independently, often resulting in a reduction in the number of nodes over a single SBDD. We show a method for partitioning a single SBDD into two parts that reduces the node count. Among the benchmark functions tested, a node reduction of up to 23% is realized.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_12_2693/_p
Copy
@ARTICLE{e85-a_12_2693,
author={Munehiro MATSUURA, Tsutomu SASAO, Jon T. BUTLER, Yukihiro IGUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Bi-Partition of Shared Binary Decision Diagrams},
year={2002},
volume={E85-A},
number={12},
pages={2693-2700},
abstract={A shared binary decision diagram (SBDD) represents a multiple-output function, where nodes are shared among BDDs representing the various outputs. A partitioned SBDD consists of two or more SBDDs that share nodes. The separate SBDDs are optimized independently, often resulting in a reduction in the number of nodes over a single SBDD. We show a method for partitioning a single SBDD into two parts that reduces the node count. Among the benchmark functions tested, a node reduction of up to 23% is realized.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Bi-Partition of Shared Binary Decision Diagrams
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2693
EP - 2700
AU - Munehiro MATSUURA
AU - Tsutomu SASAO
AU - Jon T. BUTLER
AU - Yukihiro IGUCHI
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2002
AB - A shared binary decision diagram (SBDD) represents a multiple-output function, where nodes are shared among BDDs representing the various outputs. A partitioned SBDD consists of two or more SBDDs that share nodes. The separate SBDDs are optimized independently, often resulting in a reduction in the number of nodes over a single SBDD. We show a method for partitioning a single SBDD into two parts that reduces the node count. Among the benchmark functions tested, a node reduction of up to 23% is realized.
ER -
English
