| Title: | Universal decomposition rule for OBDD, OFDD, and 0-sup-BDD |
|---|
| Authors: | Meolic, Robert, Univerza v Mariboru (Author)
Brezočnik, Zmago, Univerza v Mariboru (Author) |
|---|
| Files: |  erk96revisited-eng.pdf (235,92 KB)
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized (r6) |
|---|
| 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 |
|---|
| Year of publishing: | 2016 |
|---|
| Publisher: | Univerza v Mariboru |
|---|
| Number of pages: | 5 |
|---|
| NUK URN: | URN:SI:UM:DK:PWRBUKWY |
|---|
| License: | 
This work is available under this license: Creative Commons Attribution 4.0 International |
|---|
| Views: | 850 |
|---|
| Downloads: | 59 |
|---|
| Metadata: |     |
|---|
| Categories: | Misc.
|
|---|
|
:
|
|
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
|
|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
