This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimization of AND-EXOR Expressions Using Rewrite Rules
May 1993 (vol. 42 no. 5)
pp. 568-576

Conditions for generating optimal two-level AND-EXOR representations using rewrite rules are considered. Four results are presented. First, it is shown that a necessary condition for obtaining minimality is a temporary increase in the size of expressions during minimization. Second, a sufficient condition for obtaining minimality that consists of adding certain two rules to rule sets proposed in the literature is given. Third, transformations that allow the minimization of an expression to proceed by minimizing a transformed expression instead are defined. Fourth, it is determined experimentally that the above three theoretical results lead to better benchmarks results as well.

[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," inProc. ISCAS, 1982, pp. 49-54.
[3] R. Brayton, G. Hachtel, C. McMullen, and A. Sangio-Vincentelli,Logic Minimization Algorithms for VLSI Synthesis. Boston, MA: Kluwer Academic, 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," inProc. 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, Sept. 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. Ouine, "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, pp. 1183-1188, Nov. 1972.
[17] J. P. Robinson and C. L. Yeh, "A method for modulo-2 minimization,"IEEE Trans. Comput., vol. C-31, pp. 800-801, Aug. 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, pp. 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] T. Sasao, "Exclusive-or Sum-of-Products expressions: Their properties and minimization algorithm," IEICE Tech. Rep., VLD90-87, Dec. 1990.
[23] T. Sasao, "A transformation of multiple-valued input two-valued output functions and its application to simplification of exclusive-or sum-of-products expressions," inProc. ISMVL-91, Victoria, BC, Canada, May 1991, pp. 270-279.
[24] T. Sasao, "Logic Synthesis with EXOR Gates," inLogic 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," inProc. ICCD-90, Cambridge, MA, pp. 372-375.

Index Terms:
rewrite rules; optimal two-level AND-EXOR representations; minimality; minimization; rule sets; transformed expression; theoretical results; minimisation; rewriting systems.
Citation:
D. Brand, T. Sasao, "Minimization of AND-EXOR Expressions Using Rewrite Rules," IEEE Transactions on Computers, vol. 42, no. 5, pp. 568-576, May 1993, doi:10.1109/12.223676
Usage of this product signifies your acceptance of the Terms of Use.