Publication detail

Multi-Terminal BDD Synthesis and Applications

MIKUŠEK, P.

Original Title

Multi-Terminal BDD Synthesis and Applications

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 improved algorithm of MTBDD synthesis aiming at minimum MTBDD width or cost 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.

RIV year

2009

Released

31. 8. 2009

Publisher

IEEE Computer Society

Location

Prague

ISBN

978-1-4244-3892-1

Book

Proceedings 19th International Conference on Field Programmable Logic and Applications (FPL)

Pages from

721

Pages to

722

Pages count

2

URL

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

BibTex

@inproceedings{BUT33792,
  author="Petr {Mikušek}",
  title="Multi-Terminal BDD Synthesis and Applications",
  booktitle="Proceedings 19th International Conference on Field Programmable Logic and Applications (FPL)",
  year="2009",
  pages="721--722",
  publisher="IEEE Computer Society",
  address="Prague",
  isbn="978-1-4244-3892-1",
  url="https://www.fit.vut.cz/research/publication/8994/"
}

Documents

FPL2009.pdf