
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D. Brand, T. Sasao, "Minimization of ANDEXOR Expressions Using Rewrite Rules," IEEE Transactions on Computers, vol. 42, no. 5, pp. 568576, May, 1993.  
BibTex  x  
@article{ 10.1109/12.223676, author = {D. Brand and T. Sasao}, title = {Minimization of ANDEXOR Expressions Using Rewrite Rules}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {5}, issn = {00189340}, year = {1993}, pages = {568576}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.223676}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Minimization of ANDEXOR Expressions Using Rewrite Rules IS  5 SN  00189340 SP568 EP576 EPD  568576 A1  D. Brand, A1  T. Sasao, PY  1993 KW  rewrite rules; optimal twolevel ANDEXOR representations; minimality; minimization; rule sets; transformed expression; theoretical results; minimisation; rewriting systems. VL  42 JA  IEEE Transactions on Computers ER   
Conditions for generating optimal twolevel ANDEXOR 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. 203206, 1983.
[2] R. K. Brayton and C. T. McMullen, "The decomposition and factorization of Boolean expressions," inProc. ISCAS, 1982, pp. 4954.
[3] R. Brayton, G. Hachtel, C. McMullen, and A. SangioVincentelli,Logic Minimization Algorithms for VLSI Synthesis. Boston, MA: Kluwer Academic, 1984.
[4] D. Brand and T. Sasao, "On the minimization of ANDEXOR expressions," Res. Rep. RC 16739, IBM T. J. Watson Research Center, Apr. 1991.
[5] M. Davio, JP. Deschamps, and A. Thayse,Discrete and Switching Functions. New York: McGrawHill Int., 1978.
[6] S. Even, I. Kohavi, and A. Paz, "On minimal modulo2 sum of products for switching functions,"IEEE Trans. Electron. Comput., vol. EC16, pp. 671674, Oct. 1967.
[7] H. Fleisher, M. Tavel, and J. Yeager, "A computer algorithm for minimizing ReedMuller canonical forms,"IEEE Trans. Comput., vol. C36, no. 2, pp. 247250, 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 multioutput mixed polarity generalized ReedMuller forms," inProc. 25th Design Automat. Conf., June 1988, pp. 427432.
[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. 443458, Sept. 1974.
[11] A. Mukhophadhyay and G. Schmitz, "Minimization of EXCLUSIVEOR and LOGICAL EQUIVALENCE switching circuits,"IEEE Trans. Comput., vol. C19, no. 2, pp. 132140, Feb. 1970.
[12] D. E. Muller, "Application of Boolean algebra to switching circuit design and to error detection,"IRE Trans. Electron. Comput., vol. EC3, pp. 612, 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. 627631, Nov, 1955.
[15] G. Papakonstantinou, "Minimization of modulo2 sum of products,"IEEE Trans. Comput., vol, C28, pp. 163167, Feb. 1979.
[16] S. M. Reddy, "Easily testable realization for logic functions,"IEEE Trans. Comput., vol. C21, pp. 11831188, Nov. 1972.
[17] J. P. Robinson and C. L. Yeh, "A method for modulo2 minimization,"IEEE Trans. Comput., vol. C31, pp. 800801, Aug. 1982.
[18] K. K. Saluja and E. H. Ong, "Minimization of ReedMuller canonical expansion,"IEEE Trans. Comput., vol. C28, pp. 535537, Feb. 1979.
[19] T. Sasao, "Input variable assignment and output phase optimization of PLA's,"IEEE Trans. Comput., vol. C33, no. 10, pp. 879894, Oct. 1984.
[20] T. Sasao and P. Besslich, "On the complexity of MOD2 sum PLA's,"IEEE Trans. Comput., vol. 39, no. 2, pp. 262266, Feb. 1990.
[21] T. Sasao, "EXMIN: A simplification algorithm for ExclusiveORSumofProducts expressions for multiplevalued input twovalued output functions," ISMVL90, Charlotte, NC, May 1990.
[22] T. Sasao, "Exclusiveor SumofProducts expressions: Their properties and minimization algorithm," IEICE Tech. Rep., VLD9087, Dec. 1990.
[23] T. Sasao, "A transformation of multiplevalued input twovalued output functions and its application to simplification of exclusiveor sumofproducts expressions," inProc. ISMVL91, Victoria, BC, Canada, May 1991, pp. 270279.
[24] T. Sasao, "Logic Synthesis with EXOR Gates," inLogic Synthesis and Optimization, T. Sasao, Ed. Boston: Kluwer, 1993, pp. 259285.
[25] J. M. Saul, "An improved algorithm for the minimization of mixed polarity ReedMuller representation," inProc. ICCD90, Cambridge, MA, pp. 372375.