| Naslov: | Universal decomposition rule for OBDD, OFDD, and 0-sup-BDD |
|---|
| Avtorji: | Meolic, Robert, Univerza v Mariboru (Avtor)
Brezočnik, Zmago, Univerza v Mariboru (Avtor) |
|---|
| Datoteke: |  erk96revisited-eng.pdf (235,92 KB)
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Delo ni kategorizirano (r6) |
|---|
| Organizacija: | FERI - Fakulteta za elektrotehniko, računalništvo in informatiko |
|---|
| Opis: | 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. |
|---|
| Ključne besede: | Binary Decision Diagram, Shannon's expansion, Reed–Muller expansion, Davio expansion, Digital Circuit Design |
|---|
| Leto izida: | 2016 |
|---|
| Založnik: | Univerza v Mariboru |
|---|
| Št. strani: | 5 |
|---|
| Licenca: | 
To delo je dosegljivo pod licenco Creative Commons Priznanje avtorstva 4.0 Mednarodna |
|---|
| Število ogledov: | 522 |
|---|
| Število prenosov: | 35 |
|---|
| Metapodatki: |     |
|---|
| Področja: | Ostalo
|
|---|
|
:
|
|
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
|
|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
