Sciweavers

29 search results - page 1 / 6
» Boolean Function Manipulation on a Parallel System Using BDD...
Sort
View
HPCN
1997
Springer
13 years 8 months ago
Boolean Function Manipulation on a Parallel System Using BDDs
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
F. Bianchi, Fulvio Corno, Maurizio Rebaudengo, Mat...
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
13 years 8 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
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
13 years 10 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
ICCAD
1996
IEEE
87views Hardware» more  ICCAD 1996»
13 years 9 months ago
Partitioned ROBDDs - a compact, canonical and efficiently manipulable representation for Boolean functions
We presenta new representationfor Boolean functions called PartitionedROBDDs. In this representation we divide the Boolean space into `k' partitions and represent a function ...
Amit Narayan, Jawahar Jain, Masahiro Fujita, Alber...