Publication detail

Heuristic Synthesis of MTBDDs Based On Local Width Minimization

MIKUŠEK, P. DVOŘÁK, V.

Original Title

Heuristic Synthesis of MTBDDs Based On Local Width Minimization

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

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

Keywords

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

Authors

MIKUŠEK, P.; DVOŘÁK, V.

RIV year

2009

Released

13. 11. 2009

Publisher

Masaryk University

Location

Znojmo

ISBN

978-80-87342-04-6

Book

5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science

Pages from

235

Pages to

235

Pages count

1

URL

https://www.fit.vut.cz/research/publication/9112/

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/"
}

Documents

memics09.pdf