Title :
Pseudo-Kronecker expressions for symmetric functions
Author_Institution :
Inst. of Comput. Sci., Albert-Ludwigs-Univ., Freiburg, Germany
fDate :
9/1/1999 12:00:00 AM
Abstract :
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
Keywords :
binary decision diagrams; logic design; minimisation of switching nets; AND/EXOR expressions; exact minimization; polynomial time; pseudo-Kronecker expressions; symmetric functions; totally symmetric functions; Binary decision diagrams; Boolean functions; Circuit synthesis; Circuit testing; Costs; Data structures; Hardware; Minimization; Polynomials; Runtime;
Journal_Title :
Computers, IEEE Transactions on
