Detail publikace

Heuristic Synthesis of Multi-Terminal BDDs Based on Local Width/Cost Minimization

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

Originální název

Heuristic Synthesis of Multi-Terminal BDDs Based on Local Width/Cost Minimization

Anglický název

Heuristic Synthesis of Multi-Terminal BDDs Based on Local Width/Cost 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. The paper presents an improved algorithm of MTBDD synthesis aiming at minimum MTBDD width or cost. 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. The paper presents an improved algorithm of MTBDD synthesis aiming at minimum MTBDD width or cost. 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).

Dokumenty

BibTex


@inproceedings{BUT33791,
  author="Petr {Mikušek} and Václav {Dvořák}",
  title="Heuristic Synthesis of Multi-Terminal BDDs Based on Local Width/Cost 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. The
paper presents an improved algorithm of MTBDD synthesis aiming at minimum MTBDD
width or cost. 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="IEEE Computer Society",
  booktitle="12th EUROMICRO Conference on Digital System Design DSD 2009",
  chapter="33791",
  edition="NEUVEDEN",
  howpublished="print",
  institution="IEEE Computer Society",
  year="2009",
  month="august",
  pages="605--608",
  publisher="IEEE Computer Society",
  type="conference paper"
}