Publication Details

Heuristic Synthesis of MTBDDs Based On Local Width Minimization

MIKUŠEK, P.; DVOŘÁK, V. Heuristic Synthesis of MTBDDs Based On Local Width Minimization. 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Znojmo: Masaryk University, 2009. p. 235-235. ISBN: 978-80-87342-04-6.
Czech title
Heuristická syntéza MTBDD založená na minimalizaci lokální šířky
Type
conference paper
Language
English
Authors
Mikušek Petr, Ing.
Dvořák Václav, prof. Ing., DrSc.
Keywords

incompletely specified functions, multi-terminal BDDs, LUT cascades, iterative disjunctive decomposition, functional decomposition

Abstract

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 we will 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).

Published
2009
Pages
235–235
Proceedings
5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
ISBN
978-80-87342-04-6
Publisher
Masaryk University
Place
Znojmo
BibTeX 
@inproceedings{BUT30908,
  author="Petr {Mikušek} and Václav {Dvořák}",
  title="Heuristic Synthesis of MTBDDs Based On Local Width Minimization",
  booktitle="5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science",
  year="2009",
  pages="235--235",
  publisher="Masaryk University",
  address="Znojmo",
  isbn="978-80-87342-04-6",
  url="https://www.fit.vut.cz/research/publication/9112/"
}
Files
Back to top