Publication Details

Multi-Terminal BDD Synthesis and Applications

MIKUŠEK, P. Multi-Terminal BDD Synthesis and Applications. Proceedings 19th International Conference on Field Programmable Logic and Applications (FPL). Prague: IEEE Computer Society, 2009. p. 721-722. ISBN: 978-1-4244-3892-1.

Czech title

Syntéza multi-terminálních BDD a aplikace

Type

conference paper

Language

English

Authors

Mikušek Petr, Ing.

Keywords

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

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

Published

2009

Pages

721–722

Proceedings

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

ISBN

978-1-4244-3892-1

Publisher

IEEE Computer Society

Place

Prague

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