Detail publikace

Heuristic Synthesis of MTBDDs Based On Local Width Minimization

Originální název

Heuristic Synthesis of MTBDDs Based On Local Width Minimization

Anglický název

Heuristic Synthesis of MTBDDs Based On Local Width Minimization

Jazyk

en

Originální abstrakt

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

Anglický abstrakt

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

BibTex


@inproceedings{BUT30908,
  author="Petr {Mikušek} and Václav {Dvořák}",
  title="Heuristic Synthesis of MTBDDs Based On Local Width Minimization",
  annote="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).",
  address="Masaryk University",
  booktitle="5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science",
  chapter="30908",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Masaryk University",
  year="2009",
  month="november",
  pages="235--235",
  publisher="Masaryk University",
  type="conference paper"
}