1993 ◽  
Vol 03 (01) ◽  
pp. 3-12 ◽  
Author(s):  
DETLEF SIELING ◽  
INGO WEGENER

(Ordered) binary decision diagrams are a powerful representation for Boolean functions and are widely used in logical synthesis, verification, test pattern generation or as part of CAD tools. NC-algorithms are presented for the most important operations on this representation, e.g. evaluation for a given input, minimization, satisfiability, redundancy test, replacement of variables by constants or functions, equivalence test and synthesis. The algorithms have logarithmic run time on CRCW COMMON PRAMs with a polynomial number of processors.


2000 ◽  
Vol 103 (1-3) ◽  
pp. 237-258 ◽  
Author(s):  
Martin Sauerhoff ◽  
Ingo Wegener ◽  
Ralph Werchner

1999 ◽  
Vol 09 (03n04) ◽  
pp. 181-198 ◽  
Author(s):  
CHRISTOPH MEINEL ◽  
THORSTEN THEOBALD

Many problems in computer-aided design of highly integrated circuits (CAD for VLSI) can be transformed to the task of manipulating objects over finite domains. The efficiency of these operations depends substantially on the chosen data structures. In the last years, ordered binary decision diagrams (OBDDs) have proven to be a very efficient data structure in this context. Here, we give a survey on these developments and stress the deep interactions between basic research and practically relevant applied research with its immediate impact on the performance improvement of modern CAD design and verification tools.


Sign in / Sign up

Export Citation Format

Share Document