Efficient sum-to-one subsets algorithm for logic optimization
暂无分享,去创建一个
[1] Saburo Muroga,et al. Timing optimization for multi-level combinational networks , 1990, DAC '90.
[2] Frank M. Brown,et al. Boolean reasoning - the logic of boolean equations , 1990 .
[3] Yahiko Kambayashi,et al. The Transduction Method-Design of Logic Networks Based on Permissible Functions , 1989, IEEE Trans. Computers.
[4] R. Bryant. Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .
[5] Robert K. Brayton,et al. Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.
[6] Masahiro Fujita,et al. A resynthesis approach for network optimization , 1991, 28th ACM/IEEE Design Automation Conference.
[7] Masahiro Fujita,et al. Concurrent resynthesis for network optimization , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.
[8] Robert K. Brayton,et al. MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[9] Gary D. Hachtel,et al. BOLD: The Boulder Optimal Logic Design system , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume 1: Architecture Track.
[10] Masahiro Fujita,et al. Application of Boolean unification to combinational logic synthesis , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.