Efficient Functional Decomposition Algorithm Based on Indexed Partition Calculus
暂无分享,去创建一个
[1] Mariusz Rawski,et al. The Influence of Functional Decomposition on Modern Digital Design Process , 2005 .
[2] Lech Józwiak,et al. Information relationships and measures: an analysis apparatus for efficient information system synthesis , 1997, EUROMICRO 97. Proceedings of the 23rd EUROMICRO Conference: New Frontiers of Information Technology (Cat. No.97TB100167).
[3] M. Rawski. Application of Indexed Partition Calculus in Logic Synthesis of Boolean Functions for FPGAs , 2011 .
[4] Robert K. Brayton,et al. Boolean factoring and decomposition of logic networks , 2008, ICCAD 2008.
[5] Mariusz Rawski. Heuristic Algorithm of Bound Set Selection in Functional Decomposition for Heterogeneous FPGAs , 2011, 2011 21st International Conference on Systems Engineering.
[6] 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..
[7] Mariusz Rawski,et al. Functional Decomposition - the Value and Implication for Both Neural Networks and Digital Designing , 2006, Int. J. Comput. Intell. Appl..
[8] Tadeusz Luba,et al. Decomposition of Boolean Functions Specified by Cubes , 2003, J. Multiple Valued Log. Soft Comput..
[9] Mariusz Rawski. Decomposition of Boolean function sets , 2007 .
[10] Tsutomu Sasao,et al. Comparison of Decision Diagrams for Multiple-Output Logic Functions , 2002, IWLS.