Heuristic Synthesis of MTBDDs Based On Local Width Minimization

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F09%3APU86225" target="_blank" >RIV/00216305:26230/09:PU86225 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Heuristic Synthesis of MTBDDs Based On Local Width Minimization
Original language description
Multi-terminal Binary Decision Diagrams (MTBDDs) are useful representation of multiple output Boolean functions. However, construction of such a diagram is a difficult task, especially when in some sense optimum diagram is sought. In the presentation wewill presents an improved algorithm of MTBDD synthesis aiming at minimum MTBDD width. The presented algorithm is a core of the upgraded version of a synthesis tool that accepts incompletely specified integer-valued functions of Boolean variables specified by possibly compatible cubes. The suggested technique is suitable for hardware (LUT cascades) or firmware implementation (branching microprograms).
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
ISBN
978-80-87342-04-6
ISSN
—
e-ISSN
—
Number of pages
1
Pages from-to
—
Publisher name
Masaryk University
Place of publication
Znojmo
Event location
Znojmo
Event date
Nov 13, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)