Conference paper

Mikušek, P.: Multi-Terminal BDD Synthesis and Applications, In: Proceedings 19th International Conference on Field Programmable Logic and Applications (FPL), Prague, CZ, IEEE CS, 2009, p. 721-722, ISBN 978-1-4244-3892-1

Publication language:

english

Original title:

Multi-Terminal BDD Synthesis and Applications

Title (cs):

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

Pages:

721-722

Proceedings:

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

Conference:

The International Conference on Field Programmable Logic and Applications

Place:

Prague, CZ

Year:

2009

ISBN:

978-1-4244-3892-1

Publisher:

IEEE Computer Society

Files:

Keywords

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

Annotation

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

BibTeX:

@INPROCEEDINGS{
   author = {Petr Mikušek},
   title = {Multi-Terminal BDD Synthesis and Applications},
   pages = {721--722},
   booktitle = {Proceedings 19th International Conference on Field
	Programmable Logic and Applications (FPL)},
   year = {2009},
   location = {Prague, CZ},
   publisher = {IEEE Computer Society},
   ISBN = {978-1-4244-3892-1},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=8994}
}

You are in section

Conference paper