Publication Details
Multi-Terminal BDD Synthesis and Applications
incompletely specified functions, multi-terminal BDDs, LUT cascades, iterative disjunctive decomposition, functional decomposition
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).
@INPROCEEDINGS{FITPUB8994, author = "Petr Miku\v{s}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 = "https://www.fit.vut.cz/research/publication/8994" }