## On the Relation Between BDDs and FDDs (1995)

Venue: | INFORMATION AND COMPUTATION |

Citations: | 26 - 12 self |

### BibTeX

@INPROCEEDINGS{Becker95onthe,

author = {Bernd Becker and Rolf Drechsler and Ralph Werchner},

title = {On the Relation Between BDDs and FDDs},

booktitle = {INFORMATION AND COMPUTATION},

year = {1995},

pages = {72--83},

publisher = {}

}

### OpenURL

### Abstract

Data structures for Boolean functions build an essential component of design automation tools, especially in the area of logic synthesis. The state of the art data structure is the ordered binary decision diagram (OBDD), which results from general binary decision diagrams (BDDs), also called branching programs, by ordering restrictions. In the context of EXOR-based logic synthesis another type of decision diagram (DD), called (ordered) functional decision diagram ((O)FDD) becomes increasingly important. We study the relation between (ordered, free) BDDs and FDDs. Both, BDDs and FDDs, result from DDs by defining the represented function in different ways. If the underlying DD is complete, the relation between both types of interpretation can be described by a Boolean transformation . This allows us to relate the FDD-size of f and the BDD-size of (f) also in the case that the corresponding DDs are free or ordered, but not (necessarily) complete. We use this property to derive...