This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast OFDD-Based Minimization of Fixed Polarity Reed-Muller Expressions
November 1996 (vol. 45 no. 11)
pp. 1294-1299

Abstract—We present methods to minimize fixed polarity Reed-Muller expressions (FPRMs), i.e., two-level fixed polarity AND/EXOR canonical representations of Boolean functions, using ordered functional decision diagrams (OFDDs). We investigate the close relation between both representations and use efficient algorithms on OFDDs for exact and heuristic minimization of FPRMs. In contrast to previously published methods, our algorithm can also handle circuits with several outputs. Experimental results on large benchmarks are given to show the efficiency of our approach.

[1] B. Becker and R. Drechsler, "Synthesis for Testability: Circuits Derived from Ordered Kronecker Functional Decision Diagrams," Proc. European Design and Test Conf., p. 592, Mar. 1995.
[2] B. Becker, R. Drechsler, and M. Theobald, "On the Implementation of a Package for Efficient Representation and Manipulation of Functional Decision Diagrams," Proc. IFIP WG 10.5 Workshop Applications of the Reed-Muller Expansion in Circuit Design,Hamburg, pp. 162-169, Sept. 1993.
[3] R.K. Brayton, G.D. Hachtel, C.T. McMullen, and A.L. Sangiovanni-Vincintelli, Logic Minimization Algorithms for VLSI Synthesis.Boston: Kluwer Academic, 1984.
[4] S.D. Brown,R.J. Francis,J. Rose,, and Z.G. Vranesic,Field-Programmable Gate Arrays. Kluwer Academic Publishers, 1992.
[5] R.E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, Vol. C-35, No. 8, Aug. 1986, pp. 667-690.
[6] O. Coudert, H. Fraisse, and J.-C. Madre, "A Breakthrough in Two-Level Logic Minimization," Proc. Int'l Workshop Logic Synthesis, p. P2b, May 1993.
[7] R. Drechsler and B. Becker, "Rapid Prototyping of Fully Testable MultiLevel AND/EXOR Networks," IFIP WG 10.5 Workshop Applications of the Reed-Muller Expansion in Circuit Design,Hamburg, pp. 126-133, Sept 1993.
[8] R. Drechsler, A. Sarabi, M. Theobald, B. Becker, and M.A. Perkowski, Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams Proc. Design Automation Conf., pp. 415-419, 1994.
[9] V. Kebschull and W. Rosenstiel, "Efficient Graph-Based Computation and Manipulation of Functional Decision Diagrams," Proc. EDAC, pp. 278-282, 1993.
[10] U. Kebschull, E. Schubert, and W. Rosenstiel, Multilevel Logic Synthesis Based on Functional Decision Diagrams Proc. European Conf. Design Automation, pp. 43-47, 1992.
[11] S. Minato, "Zero-Suppressed BDDs for Set Manipulation in Combinational Problems," Proc. Design Automation Conf., pp. 272-277, June 1993.
[12] G. Papakonstantinou, "Minimization of Modulo-2 Sum of Products," IEEE Trans. Computers, vol. 28, no. 8, pp. 163-167, Feb. 1979.
[13] M.A. Perkowski and M. Chrzanowska-Jeske, "An Exact Algorithm to Minimize Mixed-Radix Exclusive Sums of Products for Incompletely Specified Boolean Functions," Proc. IEEE ISCAS, pp. 1,652-1,655, 1990.
[14] M.A. Perkowski, L. Csanky, A. Sarabi, and I. Schäfer, "Fast Minimization of Mixed-Polarity AND-XOR Canonical Networks," Proc. ICCD-92, pp. 33-36, Oct. 1992.
[15] S.M. Reddy, "Easily Testable Realizations for Logic Functions," IEEE Trans. Computers, vol. 21, no. 11, pp. 1,183-1,188, Nov. 1972.
[16] U. Rollwage, "The Complexity of Mod-2 Sum PLAs for Symmetric Functions," Proc. IFIP WG 10.5 Workshop Applications of the Reed-Muller Expansion in Circuit Design,Hamburg, pp. 6-12, Sept. 1993.
[17] A. Sarabi and M.A. Perkowski, "Fast Exact and Quasi-Minimal Minimization of Highly Testable Fixed-Polarity AND/EXOR Canonical Networks," Proc. 29th ACM/IEEE DAC, pp. 30-35, 1992.
[18] A. Sarabi and M.A. Perkowski, "Design for Testability Properties of AND/XOR Networks," Proc. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design,Hamburg, pp. 147-153, Sept. 1993.
[19] T. Sasao, "EXMIN2: A Simplification Algorithm for Exclusive-OR Sum-of-Products Expressions for Multiple-Valued-Input Two-Valued-Output Functions," IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 12, no. 5, pp. 621-632, May 1993.
[20] T. Sasao, Logic Synthesis and Optimization. Kluwer Academic, 1993.
[21] T. Sasao and P. Besslich, “On the Complexity of mod-2 Sum PLA's,” IEEE Trans. Computers, vol. 39, no. 2, pp. 262-266, Feb. 1990.
[22] J. Saul, "Logic Synthesis for Arithmetic Circuits Using the Reed-Muller Representation," Proc. European Conf. Design Automation, pp. 109-113, Mar. 1992.
[23] I. Schäfer and M.A. Perkowski, "Multiple-Valued Input Generalized Reed-Muller Forms," Proc. Int'l Symp. MultiValued Logic, pp. 40-48, May 1991.
[24] D. Sieling and I. Wegener, "Reduction of OBDDs in Linear Time," Information Processing Letters, vol. 48, pp. 139-144, 1993.
[25] C. Tsai and M. Marek-Sadowska,"Efficient minimization algorithms for fixed polarity AND/XOR canonical networks," Proc. Third Great Lakes Symp. VLSI 1993, pp. 76-79.
[26] C. Tsai and M. Marek-Sadowska,"Boolean matching using generalized Reed-Muller forms," Proc. 31st ACM/IEEE Design Automation Conf., pp. 339-344, June 1994.

Index Terms:
Logic synthesis, two-level AND/EXOR forms, FPRM, OFDD, minimization of FPRMs.
Citation:
Rolf Drechsler, Michael Theobald, Bernd Becker, "Fast OFDD-Based Minimization of Fixed Polarity Reed-Muller Expressions," IEEE Transactions on Computers, vol. 45, no. 11, pp. 1294-1299, Nov. 1996, doi:10.1109/12.544485
Usage of this product signifies your acceptance of the Terms of Use.