| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Universal decomposition rule for OBDD, OFDD, and 0-sup-BDD
Authors:ID Meolic, Robert, Univerza v Mariboru (Author)
ID Brezočnik, Zmago, Univerza v Mariboru (Author)
Files:.pdf erk96revisited-eng.pdf (235,92 KB)
MD5: 92F2AA46727CB828B8E7D74739D89C49
Work type:Not categorized
Organization:FERI - Faculty of Electrical Engineering and Computer Science
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
Publication status:Not published
Place of publishing:Maribor
Publisher:Univerza v Mariboru
Year of publishing:2016
Number of pages:5
PID:20.500.12556/DKUM-64403 New window
Publication date in DKUM:12.10.2016
Copy citation
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.


License:CC BY 4.0, Creative Commons Attribution 4.0 International
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Licensing start date:28.09.2016

Secondary language

Title:Splošno razčlenitveno pravilo za OBDD, OFDD in 0-sup-BDD
Abstract:Binarni odločitveni graf (BDD) je zelo uspešna podatkovna struktura za predstavitev in obdelavo logičnih funkcij. Predlagani so bili različni tipi BDD-jev. Ta članek obravnava razmerja med OBDD, OFDD in 0-sup-BDD na nov način. Predstavljeno je splošno razčlenitveno pravilo za njih. S pomočjo tega pravila je definirana množica 288 tipov BDD-jev in pravila za njihovo minimizacijo.
Keywords:binarni odločitveni graf, Shannonova razčlenitev, Reed-Mullerjeva razčlenitev, Daviova razčlenitev, načrtovanje digitalnih vezij


Leave comment

You must log in to leave a comment.

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

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