Publication detail

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

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

Original Title

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

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

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

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

27. 8. 2009

Publisher

IEEE Computer Society

Location

Patras

ISBN

978-0-7695-3782-5

Book

12th EUROMICRO Conference on Digital System Design DSD 2009

Pages from

605

Pages to

608

Pages count

4

URL

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

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",
  booktitle="12th EUROMICRO Conference on Digital System Design DSD 2009",
  year="2009",
  pages="605--608",
  publisher="IEEE Computer Society",
  address="Patras",
  isbn="978-0-7695-3782-5",
  url="https://www.fit.vut.cz/research/publication/8993/"
}