Naslov: | Universal decomposition rule for OBDD, OFDD, and 0-sup-BDD |
---|
Avtorji: | ID Meolic, Robert, Univerza v Mariboru (Avtor) ID Brezočnik, Zmago, Univerza v Mariboru (Avtor) |
Datoteke: | erk96revisited-eng.pdf (235,92 KB) MD5: 92F2AA46727CB828B8E7D74739D89C49
|
---|
Jezik: | Angleški jezik |
---|
Vrsta gradiva: | Delo ni kategorizirano |
---|
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 |
---|
Status objave pri reviji: | Neobjavljeno |
---|
Kraj izida: | Maribor |
---|
Založnik: | Univerza v Mariboru |
---|
Leto izida: | 2016 |
---|
Št. strani: | 5 |
---|
PID: | 20.500.12556/DKUM-64403  |
---|
NUK URN: | URN:SI:UM:DK:PWRBUKWY |
---|
Datum objave v DKUM: | 12.10.2016 |
---|
Število ogledov: | 1978 |
---|
Število prenosov: | 80 |
---|
Metapodatki: |  |
---|
Področja: | Ostalo
|
---|
:
|
Kopiraj citat |
---|
| | | 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. |