Result Details
Multi-Terminal BDD Synthesis and Applications
Multi-terminal Binary Decision Diagrams (MTBDDs) are usefulrepresentation 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).
incompletely specified functions, multi-terminal BDDs, LUT cascades,iterative disjunctive decomposition, functional decomposition
@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/"
}
Mathematical and Engineering Approaches to Developing Reliable and Secure Concurrent and Distributed Computer Systems, GACR, Doktorské granty, GD102/09/H042, start: 2009-01-30, end: 2012-12-31, completed
Safety and security of networked embedded system applications, GACR, Standardní projekty, GA102/08/1429, start: 2008-01-01, end: 2010-12-31, completed
Security-Oriented Research in Information Technology, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, start: 2007-01-01, end: 2013-12-31, running