Functional decomposition based on information relationship measures extremely effective for symmetric functions
暂无分享,去创建一个
[1] Tadeusz Luba,et al. Decomposition of multiple-valued functions , 1995, Proceedings 25th International Symposium on Multiple-Valued Logic.
[2] Mariusz Rawski,et al. Non-disjoint decomposition of Boolean functions and its application in FPGA-oriented technology mapping , 1997, EUROMICRO 97. Proceedings of the 23rd EUROMICRO Conference: New Frontiers of Information Technology (Cat. No.97TB100167).
[3] Lech Jóźwiak,et al. General Decomposition and Its Use in Digital Circuit Synthesis , 1995 .
[4] Bo-Gwan Kim,et al. Multilevel logic synthesis of symmetric switching functions , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[5] Feng Wang,et al. Exploiting near symmetry in multilevel logic synthesis , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] Massoud Pedram,et al. OBDD-based function decomposition: algorithms and implementation , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[7] Shih-Chieh Chang,et al. Technology mapping for TLU FPGAs based on decomposition of binary decision diagrams , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[8] Mpj Mario Stevens,et al. Division-Based Versus General Decomposition-Based Multiple-Level Logic Synthesis , 1995 .
[9] H. Allen Curtis. A Generalized Tree Circuit , 1961, JACM.