Publication detail

Multi-Terminal BDD Synthesis and Applications

MIKUŠEK, P.

Original Title

Multi-Terminal BDD Synthesis and Applications

English Title

Multi-Terminal BDD Synthesis and Applications

Type

conference paper

Language

en

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

English 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

RIV year

2009

Released

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

Edition

NEUVEDEN

Edition number

NEUVEDEN

Pages from

721

Pages to

722

Pages count

2

URL

BibTex


@inproceedings{BUT33792,
  author="Petr {Mikušek}",
  title="Multi-Terminal BDD Synthesis and Applications",
  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
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).",
  address="IEEE Computer Society",
  booktitle="Proceedings 19th International Conference on Field Programmable Logic and Applications (FPL)",
  chapter="33792",
  edition="NEUVEDEN",
  howpublished="print",
  institution="IEEE Computer Society",
  year="2009",
  month="august",
  pages="721--722",
  publisher="IEEE Computer Society",
  type="conference paper"
}