SLO | ENG

Bigger font | Smaller font

Show document

Title:Uporaba urejenih odločitvenih grafov pri računalniški obdelavi logičnih funkcij : diplomsko delo visokošolskega študija
Authors:Meolic, Robert, Univerza v Mariboru (Author)
Files:.pdf dipl.pdf (560,59 KB)
 
Language:Slovenian
Work type:Undergraduate thesis (m5)
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:Odločitveni grafi so uspešna podatkovna struktura za predstavitev logičnih funkcij. V diplomskem delu so podane potrebne matematične osnove za njihovo razumevanje in računalniški algoritmi za njihovo učinkovito realizacijo. Podrobno so opisani urejeni binarni odločitveni grafi (OBDD), urejeni funkcijski odločitveni grafi (OFDD) in urejeni binarni odločitveni grafi s potlačenimi ničlami (0-sup-BDD). Dodan je pregledni opis prostih binarnih odločitvenih grafov (FBDD), razširjenih binarnih odločitvenih grafov (XBDD), urejenih Kroneckerjevih funkcijskih odločitvenih grafov (OKFDD) in diferenčnih binarnih odločitvenih grafov (\delta BDD). Za ROBDD, ROFDD in 0-sup-BDD so podani razčlenitveno pravilo, pravilo minimizacije in algoritmi za logične operacije, ki so tudi izpeljani. Algoritmi so bili realizirani v programskem jeziku C. Prikazani so rezultati testov, v katerih se primerja učinkovitost različnih vrst odločitvenih grafov pri preverjanju enakosti logičnih funkcij, pri predstavitvi množic kombinacij in pri predstavitvi slik.
Keywords:Boolova algebra, logične funkcije, binarni odločitveni grafi, funkcijski odločitveni grafi, podatkovne strukture
Year of publishing:1995
Publisher:[R. Meolic]
Number of pages:98
Source:Maribor
UDC:681.3.01:519.1
COBISS_ID:1821974 Link is opened in a new window
License:CC BY 4.0
This work is available under this license: Creative Commons Attribution 4.0 International
Views:293
Downloads:26
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:KTFMB - FERI
Misc.
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:Using Ordered Decision Diagrams for Computer-Aided Manipulation of Boolean Functions : diploma work
Abstract:Decision Diagrams are successful data structure for representation of Boolean functions. Mathematical background needed for their understanding and computer algorithms for their efficient implementation are given in this diploma work. Ordered Binary Decision Diagrams (OBDDs), Ordered Functional Decision Diagrams (OFDDs) and Zero-Suppresed Binary Decision Diagrams (0-sup-BDDs) are described in details. Also, a short overview of Free Binary Decision Diagrams (FBDDs), Extended Binary Decision Diagrams (XBDDs), Ordered Kronecker Functional Decision Diagrams (OKFDDs) and Differential Binary Decision Diagrams (\delta BDDs) is included. For ROBDD, ROFDD, and 0-sup-BDD the decomposition rule and reduction rule are shown and algorithms for logical operations are derived. Algorithms were realized in programming language C. Efficiency of various types of decision diagrams is compared. Results of tests in the domains of Boolean function equality testing, representing combination sets, and representing images are given.
Keywords:Boolean algebra, Boolean functions, Binary Decision Diagrams, Functional Decision Diagrams, data structures


Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica