Publication Details
Heuristic Synthesis of MTBDDs Based On Local Width Minimization
incompletely specified functions, multi-terminal BDDs, LUT cascades, iterative disjunctive decomposition, functional decomposition
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).
@INPROCEEDINGS{FITPUB9112, author = "Petr Miku\v{s}ek and V\'{a}clav Dvo\v{r}\'{a}k", title = "Heuristic Synthesis of MTBDDs Based On Local Width Minimization", pages = "235--235", booktitle = "5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science", year = 2009, location = "Znojmo, CZ", publisher = "Masaryk University", ISBN = "978-80-87342-04-6", language = "english", url = "https://www.fit.vut.cz/research/publication/9112" }