1. Representation of Boolean functions with ROBDDsAleš Časar, Robert Meolic, independent scientific component part or a chapter in a monograph Abstract: This paper describes data structures and algorithms for representation of Boolean functions with reduced ordered binary decision diagrams (ROBDDs). A hash table is used for quick search. Additional information about variables and functions is stored in binary trees. Manipulations on functions are based on a recursive algorithm of ITE operation. The primary goal of this article is describe programming technics needed to realize the idea. For the first time here recursive algorithms for composing functions and garbage collection with a formulae counter are presented. This is better than garbage collection in other known implementations. The results of the tests show that the described representation is very efficient in applications which operate with Boolean functions.
Keywords: Reduced Ordered Binary Decision Diagram, Boolean function, logic functions, logic design verification, hash table
Published: 02.02.2018; Views: 1371; Downloads: 32
 Full text (323,32 KB) |
2. Implementation aspects of a BDD package supporting general decision diagramsRobert Meolic, 2016, invited lecture at foreign university Abstract: 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.
Keywords: Binary Decision Diagram, Zero-suppressed Binary Decision Diagram, Boolean function, Algorithm, BDD package, Biddy
Published: 26.10.2017; Views: 1531; Downloads: 58
Full text (1,07 MB) |
3. Universal decomposition rule for OBDD, OFDD, and 0-sup-BDDRobert Meolic, Zmago Brezočnik, 2016 Abstract: 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.
Keywords: Binary Decision Diagram, Shannon's expansion, Reed–Muller expansion, Davio expansion, Digital Circuit Design
Published: 12.10.2016; Views: 1110; Downloads: 67
Full text (235,92 KB) |
