Sciweavers

4 search results - page 1 / 1
» Blockwise Variable Orderings for Shared BDDs
Sort
View
MFCS
1998
Springer
14 years 3 months ago
Blockwise Variable Orderings for Shared BDDs
In this paper we consider the problem of characterizing optimal variable orderings for shared OBDDs of two Boolean functions fi = gi i hi, i = 1, 2, where i is an operator from th...
Harry Preuß, Anand Srivastav
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
14 years 3 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
JUCS
2010
143views more  JUCS 2010»
13 years 9 months ago
Design of Arbiters and Allocators Based on Multi-Terminal BDDs
: Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways...
Václav Dvorák, Petr Mikusek
DAC
2003
ACM
14 years 12 months ago
Symbolic representation with ordered function templates
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
Amit Goel, Gagan Hasteer, Randal E. Bryant