| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 1 / 1
First pagePrevious page1Next pageLast page
1.
Universal decomposition rule for OBDD, OFDD, and 0-sup-BDD
Robert Meolic, Zmago Brezočnik, 2016

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
Published in DKUM: 12.10.2016; Views: 2500; Downloads: 87
.pdf Full text (235,92 KB)

Search done in 0.01 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica