Multi-terminal BDD synthesis and applications
暂无分享,去创建一个
Design of digital systems is based on various specifications of Boolean functions, most often in a form of Boolean expressions or in PLA format. Recently also binary decision diagrams (BDDs) became popular means of design, verification and testing. Conversion of a single Boolean function into a BDD was studied intensively [1] including related optimization problems. As the ordering influences the size and shape of the diagram, we should find among all possible orderings of variables the one that produces a optimal diagram.
[1] Tadeusz Luba,et al. Decomposition of Boolean Functions Specified by Cubes , 2003, J. Multiple Valued Log. Soft Comput..
[2] Tsutomu Sasao,et al. BDD representation for incompletely specified multiple-output logic functions and its applications to functional decomposition , 2005, Proceedings. 42nd Design Automation Conference, 2005..
[3] Petr Miku. On Lookup Table Cascade-Based Realizations of Arbiters , 2008 .
[4] Radomir S. Stankovic,et al. Decision Diagram Techniques for Micro- and Nanoelectronic Design Handbook , 2018 .