SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 2 / 2
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Representation of Boolean functions with ROBDDs
Aleš Časar, Robert Meolic, samostojni znanstveni sestavek ali poglavje v monografski publikaciji

Opis: 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.
Ključne besede: Reduced Ordered Binary Decision Diagram, Boolean function, logic functions, logic design verification, hash table
Objavljeno: 02.02.2018; Ogledov: 146; Prenosov: 4
.pdf Celotno besedilo (323,32 KB)

2.
Implementation aspects of a BDD package supporting general decision diagrams
Robert Meolic, 2016, predavanje na tuji univerzi

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, Biddy
Objavljeno: 26.10.2017; Ogledov: 304; Prenosov: 16
.pdf Celotno besedilo (1,07 MB)

Iskanje izvedeno v 0.05 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici