Graph driven BDDs — a new data structure for Boolean functions

Detlef Sieling, Ingo Wegener
1995 Theoretical Computer Science  
Ordered) binary decision diagrams (OBDDs) are used as a data structure for Boolean functions in the logical synthesis process, for verification and test pattern generation, and as part of CAD tools. For several important functions like arithmetical and logical units with quite different functions, the indirect storage access function or the hidden weighted bit function OBDDs have exponential size for any ordering of the variables. Since an ordering of the variables may be stored as a list,
more » ... may also be called list driven BDDs. Two new generalized models of graph driven BDDs are presented. The above mentioned and many other functions can be represented in small polynomial size in this model and the usual operations on OBDDs can be performed efficiently also for graph driven BDDs.
doi:10.1016/0304-3975(94)00078-w fatcat:q4yroj4gifb5jnbkqzyhkj3t2a