Publication Details
Heuristic Synthesis of MTBDDs Based On Local Width Minimization
Dvořák Václav, prof. Ing., DrSc.
incompletely specified functions, multi-terminal BDDs, LUT cascades,iterative disjunctive decomposition, functional decomposition
Multi-terminal Binary Decision Diagrams (MTBDDs) are usefulrepresentation of multiple output Boolean functions. However,construction of such a diagram is a difficult task, especially when insome sense optimum diagram is sought. In the presentation we will presents an improvedalgorithm of MTBDD synthesis aiming at minimum MTBDD width. Thepresented algorithm is a core of the upgraded version of a synthesistool that accepts incompletely specified integer-valued functions ofBoolean variables specified by possibly compatible cubes. The suggestedtechnique is suitable for hardware (LUT cascades) or firmwareimplementation (branching microprograms).
@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/"
}