Bi-partition of shared binary decision diagrams
Loading...
Authors
Sasao, Tsutomu
Butler, Jon T.
Matsuura, Munehiro
Iguchi, Yukihiro
Subjects
Shared binary decision diagram
SBDD
bi-partition
multiple-output function
decomposition
SBDD
bi-partition
multiple-output function
decomposition
Advisors
Date of Issue
2001-08
Date
August 24, 2001
Publisher
Language
Abstract
A shared binary decision diagram (SBDD) represents a
multiple-output function, where nodes are shared among
outputs. A partitioned SBDD usually consists of two or
more SBDDs that often 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 16% is realized.
Type
Article
Description
IEEE Transactions on Computers, Vol. 50, No. 9, Sept. 2001, pp. 935-948.
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.
Series/Report No
Department
Department of Electrical and Computer Engineering
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
T. Sasao and J. T. Butler, "Worst and best irredundant sum-of-products expressions, " IEEE Transactions on Computers, Vol. 50, No. 9, Sept. 2001, pp. 935-948.