Some heuristics for generating tree-like FBDD types

Keywords (3)

Related Publications (1)

Minimization of free BDDs

Academic

Publications

Some heuristics for generating tree-like FBDD types

Edit

Some heuristics for generating tree-like FBDD types (Citations: 20)


	BibTex \| RIS \| RefWorks Download

, ,

Reduced ordered binary decision diagrams(OBDDs) are nowadays the state-of-theartrepresentation scheme for Boolean functions inBoolean manipulation. Recent results have shownthat it is possible to use the more general conceptof free binary decision diagrams (FBDDs) withoutgiving up most of the useful computational propertiesof OBDDs, but possibly reducing the spacerequirements considerably. The amount of spacereduction depends essentially on the shape of so--called FBDD--types the...

Journal: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - TCAD , vol. 15, no. 1, pp. 127-130, 1996

DOI: 10.1109/43.486278

Cumulative Annual

View Publication

( ieeexplore.ieee.org )

Citation Context (9)

- ...First approaches have been presented in [5, 6, 7], but no significan t improvements over OBDDs have been reported...
Robert Wille, et al. Building Free Binary Decision Diagrams Using SAT Solvers
- ...Finding a small free BDD for a given functionturnedouttobeatleastasdifficultasfinding a good order for an OBDD [12], [13], [14], [15]...
Wolfgang Günther, et al. Efficient Minimization and Manipulation of Linearly Transformed Binary...
- ...Similar to the variable ordering problem for OBDDs we have the problem to choose a suitable graph ordering.Bern, Meinel, and Slobodov´a [14] present heuristics to create graph orderings which have a tree-like shape...
Rolf Drechsler, et al. Binary decision diagrams in theory and practice
- ...However, to retain canonicity in FBDDs an additional data structure, called the FBDD-type, has to be constructed and finding an FBDD-type without user interaction turns out to be at least as difficult as finding an ordering for an OBDD [3]...
Wolfgang Günther, et al. Implementation of Read k-times BDDs on Top of Standard BDD Packages
- ...Bern et al. [3] have presented some heuristics to find good graph orderings...
Detlef Sieling, et al. A Comparison of Free BDDs and Transformed BDDs

References (10)

On the Complexity of Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs (Citations: 4)

Jordan Gergov, Christoph Meinel

Journal: Information Processing Letters - IPL , vol. 50, no. 6, pp. 317-322, 1994
Cycle Compensation Protocol: A Fair Protocol for the Unidirectional Twin-Bus Architecture (Citations: 6)

Yean-shiang Leu, David Hung-chang Du

Journal: IEEE Transactions on Computers - TC , vol. 43, no. 1, pp. 1-12, 1994
Symbolic Boolean manipulation with ordered binary-decision diagrams (Citations: 1260)

Randal E. Bryant

Journal: ACM Computing Surveys - CSUR , vol. 24, no. 3, pp. 293-318, 1992
Graph-Based Algorithms for Boolean Function Manipulation (Citations: 5294)

Randal E. Bryant

Journal: IEEE Transactions on Computers - TC , vol. C-35, no. 8, pp. 677-691, 1986
Binary Decision Diagrams (Citations: 686)

Sheldon B. Akers

Journal: IEEE Transactions on Computers - TC , vol. 27, no. 6, pp. 509-516, 1978

Order by:

Citations (20)

Building Free Binary Decision Diagrams Using SAT Solvers (Citations: 1)

Robert Wille, Rolf Drechsler

Published in 2007.
Decision Selection and Learning for an All-Solutions ATPG Engine (Citations: 1)

Kameshwar Chandrasekar, Michael S. Hsiao

Conference: International Conference on Recent Trends in Information, Telecommunication and Computing - ITC , pp. 607-616, 2004
Decision selection and learning for an 'all-solutions ATPG engine'

Kameshwar Chandrasekar, Michael S. Hsiao

Conference: International Test Conference - ITC , 2004
Efficient Minimization and Manipulation of Linearly Transformed Binary Decision Diagrams (Citations: 5)

Wolfgang Günther, Rolf Drechsler

Journal: IEEE Transactions on Computers - TC , vol. 52, no. 9, pp. 1196-1209, 2003
Minimization of free BDDs (Citations: 21)

Wolfgang Günther, Rolf Drechsler

Journal: Integration , vol. 32, no. 1-2, pp. 41-59, 2002


	The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.

Keywords (3)

Related Publications (1)

Citation Context (9)

Robert Wille, et al. Building Free Binary Decision Diagrams Using SAT Solvers

Wolfgang Günther, et al. Efficient Minimization and Manipulation of Linearly Transformed Binary...

Rolf Drechsler, et al. Binary decision diagrams in theory and practice

Wolfgang Günther, et al. Implementation of Read k-times BDDs on Top of Standard BDD Packages

Detlef Sieling, et al. A Comparison of Free BDDs and Transformed BDDs

References (10)

On the Complexity of Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs (Citations: 4)

Cycle Compensation Protocol: A Fair Protocol for the Unidirectional Twin-Bus Architecture (Citations: 6)

Symbolic Boolean manipulation with ordered binary-decision diagrams (Citations: 1260)

Graph-Based Algorithms for Boolean Function Manipulation (Citations: 5294)

Binary Decision Diagrams (Citations: 686)

Citations (20)

Building Free Binary Decision Diagrams Using SAT Solvers (Citations: 1)

Decision Selection and Learning for an All-Solutions ATPG Engine (Citations: 1)

Decision selection and learning for an 'all-solutions ATPG engine'

Efficient Minimization and Manipulation of Linearly Transformed Binary Decision Diagrams (Citations: 5)

Minimization of free BDDs (Citations: 21)