Opis: Binary decision diagram (BDD) is a very successful data structure for
representation and manipulation of Boolean functions. Various BDD types
have been proposed. In this paper relations between OBDD, OFDD, and
0-sup-BDD are shown in a new way. An universal decomposition rule for them
is introduced. Using this rule a set of 288 BDD types is defined
together with their minimization rules.
NOTE: This is a revisited and translated version of the paper: "Splošno razčlenitveno pravilo za OBDD, OFDD in 0-sup-BDD". In Proceedings of the Fifth Electrotechnical and Computer Science Conference ERK'96, Portorož, Slovenia, volume B, pages 11-14, September 1996.Ključne besede: Binary Decision Diagram, Shannon's expansion, Reed–Muller expansion, Davio expansion, Digital Circuit DesignObjavljeno: 12.10.2016; Ogledov: 345; Prenosov: 18 Celotno besedilo (235,92 KB)
Opis: General decision diagram is a loose term for a superset of different types of decision diagrams - we are interested in joining BDDs, FDDs, and different types of suppressed DDs, e.g. ZBDDs. I will present: The current state of our BDD package Biddy (functionalities and details about the original implementation aspects). Our ideas for efficient implementation of ZBDDs (which could be used for all types of suppressed DDs).New type od decision diagrams called ZFDD (somehow symmetric to ZBDD). A rough draft about the implementation of a package supporting general decision diagrams.Ključne besede: Binary Decision Diagram, Zero-suppressed Binary Decision Diagram, Boolean function, Algorithm, BDD package, BiddyObjavljeno: 26.10.2017; Ogledov: 80; Prenosov: 5 Celotno besedilo (1,07 MB)