Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
COBISS
Ekonomsko poslovna fakulteta
Fakulteta za kmetijstvo
Fakulteta za logistiko
Fakulteta za organizacijske vede
Fakulteta za varnostne vede
Fakulteta za zdravstvene vede
Knjižnica tehniških fakultet
Medicinska fakulteta
Miklošičeva knjižnica - FPNM
Pravna fakulteta
Univerzitetna knjižnica Maribor
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
Representation of Boolean functions with ROBDDs
Authors:
Časar, Aleš
(Author)
Meolic, Robert
(Author)
Files:
robdd-casar-meolic.pdf
(323,32 KB)
Language:
English
Work type:
Not categorized (r6)
Typology:
1.16 - Independent Scientific Component Part or a Chapter in a Monograph
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
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
Number of pages:
[8] str.
UDC:
004:519.2
COBISS_ID:
6992150
NUK URN:
URN:SI:UM:DK:SESLSZ31
License:
This work is available under this license:
Creative Commons Attribution 4.0 International
Views:
1227
Downloads:
29
Metadata:
Categories:
Misc.
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Average score:
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
AddThis uses cookies that require your consent.
Edit consent...
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Record is a part of a monograph
Title:
IEEE Student paper contest
Subtitle:
regional contest winners 1990-1997
Publisher:
#The #Institute of Electrical and Electronics Engineers
COBISS.SI-ID:
6991894
Place of publishing:
Piscataway
Year of publishing:
2000
Secondary language
Language:
English
Keywords:
Boolove funkcije
,
algoritmi
,
binarni odločitveni diagram
,
struktura podatkov
Comments
Leave comment
You have to
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
