GRMIN2: A heuristic simplification algorithm for generalised Reed-Muller expressions
暂无分享,去创建一个
[1] Hideo Fujiwara,et al. Logic Testing and Design for Testability , 1985 .
[2] Jean-Pierre Deschamps,et al. Discrete and switching functions , 1978 .
[3] C. L. Liu,et al. Introduction to Combinatorial Mathematics. , 1971 .
[4] Martin Cohn. Inconsistent Canonical Forms of Switching Functions , 1962, IRE Trans. Electron. Comput..
[5] Tsutomu Sasao,et al. Input Variable Assignment and Output Phase Optimization of PLA's , 1984, IEEE Transactions on Computers.
[6] S. M Reddy,et al. Easily testable realizations for logic functions , 1973 .
[7] Tsutomu Sasao,et al. Minimization of AND-EXOR Expressions Using Rewrite Rules , 1993, IEEE Trans. Computers.
[8] D. Green. Families of Reed-Muller canonical forms , 1991 .
[9] Tsutomu Sasao. And-Exor Expressions and their Optimization , 1993 .
[10] Tsutomu Sasao,et al. On the complexity of mod-2l sum PLA's , 1990 .
[11] Daniel L. Ostapko,et al. MINI: A Heuristic Approach for Logic Minimization , 1974, IBM J. Res. Dev..
[12] Tsutomu Sasao,et al. Representations of Logic Functions Using EXOR Operators , 1996 .
[13] Malgorzata Marek-Sadowska,et al. Generalized Reed-Muller Forms as a Tool to Detect Symmetries , 1996, IEEE Trans. Computers.
[14] David H. Green,et al. Modern logic design , 1986 .
[15] Sudhakar M. Reddy,et al. Fault Detecting Test Sets for Reed-Muller Canonic Networks , 1975, IEEE Transactions on Computers.
[16] Amar Mukhopadhyay,et al. Minimization of Exclusive or and Logical Equivalence Switching Circuits , 1970, IEEE Transactions on Computers.