Pseudo Kronecker expressions for symmetric functions

Pseudo Kronecker Expressions (PSDKROs) are a class of AND/EXOR expressions. In this paper it is proven that exact minimization of PSDKROs for totally symmetric functions can be performed in polynomial time. A new implementation method for PSDKROs is presented. Experimental results are given to show the efficiency of the presented approach in comparison to previously published work on AND/EXOR minimization.

[1]  Dhiraj K. Pradhan,et al.  LOT: Logic optimization with testability - new transformations using recursive learning , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[2]  Rolf Drechsler,et al.  Exact minimisation of Kronecker expressions for symmetric functions , 1996 .

[3]  Tsutomu Sasao.  EXMIN2: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued-input two-valued-output functions , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Dhiraj K. Pradhan,et al.  LOT: logic optimization with testability—new transformations using recursive learning , 1995, ICCAD.

[5]  Tsutomu Sasao,et al.  Logic Synthesis and Optimization , 1997 .

[6]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[7]  SUDHAKAR M. REDDY,et al.  Easily Testable Realizations ror Logic Functions , 1972, IEEE Transactions on Computers.

[8]  Rolf Drechsler,et al.  Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[9]  Marek A. Perkowski,et al.  Multiple-valued generalized Reed-Muller forms , 1991, [1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic.

[10]  M. Perkowski,et al.  Multiple valued input generalised Reed-Muller forms , 1992 .

[11]  Rolf Drechsler,et al.  Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions , 1995, EDTC '95.

[12]  Jean-Pierre Deschamps,et al.  Discrete and switching functions , 1978 .

[13]  Rolf Drechsler,et al.  Exact minimization of Kronecker expressions for symmetric functions , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[14]  Tomasz Kozlowski,et al.  An enhanced algorithm for the minimization of exclusive-OR sum-of-products for incompletely specified functions , 1995, Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors.

[15]  Sudhakar M. Reddy,et al.  Fault Detecting Test Sets for Reed-Muller Canonic Networks , 1975, IEEE Transactions on Computers.

[16]  Tsutomu Sasao.  And-Exor Expressions and their Optimization , 1993 .

[17]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[18]  J. Saul,et al.  Two-level logic circuits using EXOR sums of products , 1993 .

[19]  Marek Perkowski,et al.  Design For Testability Properties of AND/XOR Networks , 1993 .