Minimization of AND-EXOR Expressions Using Rewrite Rules

IEEE Transactions on Computers

Volumn 42, Issue 5, 1993, Pages 568-576

  Brand, Daniel ^a   Sasao, Tsutomu ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

EXOR; L transformation; logic minimization; nondeterministic algorithm; Reed Muller expansion; representation; two level

Indexed keywords

LOGIC CIRCUITS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION;

AND-EXOR REPRESENTATIONS; REWRITE RULES;

LOGIC DESIGN;

EID: 0027594599     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.223676     Document Type: Article

References (25)

1. Ph. W. Besslich, “Efficient computer method for ExOR logic design,” IEE Proc., vol. 130, pt. E, pp. 203–206, 1983.
2. R. K. Brayton and C. T. McMullen, “The decomposition and factorization of Boolean expressions,” in Proc. ISCAS, 1982, pp. 49–54.
3. R. K. Brayton, G. D. Hachtel, C. T. McMullen, and A. L. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis. Boston, MA: Kluwer, 1984.
4. D. Brand and T. Sasao, “On the minimization of AND-EXOR expressions,” Res. Rep. RC 16739, IBM T. J. Watson Research Center, Apr. 1991
5. M. Davio, J.P. Deschamps, and A. Thayse, Discrete and Switching Functions. New York: McGraw-Hill Int., 1978.
6. S. Even, I. Kohavi, and A. Paz, “On minimal modulo-2 sum of products for switching functions,” IEEE Trans. Electron. Comput., vol. EC-16, pp. 671–674, Oct. 1967.
7. H. Fleisher, M. Tavel, and J. Yeager, “A computer algorithm for minimizing Reed-Muller canonical forms,” IEEE Trans. Comput., vol. C-36, no. 2, pp. 247- 250, Feb. 1987.
8. H. Fujiwara, Logic Testing and Design for Testability. Cambridge, MA: Computer Systems Series, M.I.T. Press, 1986.
9. M. Helliwel and M. Perkowski, “A fast algorithm to minimize multi-output mixed polarity generalized Reed-Muller forms,” in Proc. 25th Design Automat. Conf, June 1988, pp. 427–432.
10. S. J. Hong, R. G. Cain, and D. L. Ostapko, “MINI: A heuristic approach for logic minimization,” IBM J. Res. Develop., vol. 18, pp. 443–458, 1974.
11. A. Mukhophadhyay and G. Schmitz, “Minimization of EXCLUSIVE-OR and LOGICAL EQUIVALENCE switching circuits,” IEEE Trans. Comput., vol. C-19, no. 2, pp. 132–140, Feb. 1970.
12. D. E. Muller, “Application of Boolean algebra to switching circuit design and to error detection,” IRE Trans. Electron. Comput., vol. EC-3, pp. 6–12, Sept. 1954.
13. S. Muroga, Logic Design and Switching Theory. New York: Wiley, 1979.
14. W. V. Quine, “A way to simplify truth functions,” Amer. Math. Monthly, vol. 62, pp. 627–631, Nov. 1955.
15. G. Papakonstantinou, “Minimization of modulo-2 sum of products,” IEEE Trans. Comput., vol. C-28, pp. 163–167, Feb. 1979.
16. S. M. Reddy, “Easily testable realization for logic functions,” IEEE Trans. Comput., vol. C-21, 1183–1188, Nov. 1972.
17. J. P. Robinson and C. L. Yeh, “A method for modulo-2 minimization,” IEEE Trans. vol. C-31, 1982.
18. K. K. Saluja and E. H. Ong, “Minimization of Reed-Muller canonical expansion,” IEEE Trans. Comput., vol. C-28, pp. 535–537, Feb. 1979.
19. T. Sasao, “Input variable assignment and output phase optimization of PLA’s,” IEEE Trans. Comput., vol. C-33, no. 10, pp. 879–894, Oct. 1984.
20. T. Sasao and P. Besslich, “On the complexity of MOD-2 sum PLA’s,” IEEE Trans. Comput., vol. 39, no. 2, 262–266, Feb. 1990.
21. T. Sasao, “EXMIN: A simplification algorithm for Exclusive-OR-Sum-of-Products expressions for multiple-valued input two-valued output functions,” ISMVL-90, Charlotte, NC, May 1990.
22. “Exclusive-or Sum-of-Products expressions: Their properties and minimization algorithm,” IEICE Tech. VLD90-87, Dec. 1990.
23. “A transformation of multiple-valued input two-valued output functions and its application to simplification of exclusive-or sum-of-products expressions,” in Proc. ISMVL-91, Victoria, BC, Canada, May 1991, 270–279.
24. T. Sasao, “Logic Synthesis with EXOR Gates,” in Logic Synthesis and Optimization, T. Sasao, Ed. Boston: Kluwer, 1993, pp. 259–285.
25. J. M. Saul, “An improved algorithm for the minimization of mixed polarity Reed-Muller representation,” in Proc. ICCD-90, Cambridge, MA, pp. 372–375.