A Unified Approach to Canonical Form-based Boolean Matching
暂无分享,去创建一个
[1] Andreas Kuehlmann,et al. Building a Better Boolean Matcher and Symmetry Detector , 2006, Proceedings of the Design Automation & Test in Europe Conference.
[2] Sharad Malik,et al. Limits of using signatures for permutation independent Boolean comparison , 1995, ASP-DAC '95.
[3] Jerry R. Burch,et al. Efficient Boolean function matching , 1992, ICCAD.
[4] Massoud Pedram,et al. A new canonical form for fast Boolean matching in logic synthesis and verification , 2005, Proceedings. 42nd Design Automation Conference, 2005..
[5] Luca Benini,et al. A survey of Boolean matching techniques for library binding , 1997, TODE.
[6] Carl Sechen,et al. Efficient canonical form for Boolean matching of complex functions in large libraries , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).
[7] B. Sankur,et al. Applications of Walsh and related functions , 1986 .
[8] Jim Hefferon,et al. Linear Algebra , 2012 .
[9] Tsutomu Sasao,et al. Efficient computation of canonical form for Boolean matching in large libraries , 2004 .
[10] S. L. Hurst,et al. A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods , 1978, IEEE Transactions on Computers.
[11] L. Shen,et al. Linear Algebra , 1968 .