DocumentCode
1568911
Title
Exact minimization of Kronecker expressions for symmetric functions
Author
Becker, Bernd ; Drechsler, Rolf
Author_Institution
Inst. of Comput. Sci., Albert-Ludwigs-Univ., Freiburg, Germany
Volume
4
fYear
1996
Firstpage
388
Abstract
In this paper an algorithm for the exact minimization of Kronecker expressions (KROs) for totally symmetric functions is presented. KROs are a class of AND/EXOR forms closely related to Ordered Kronecker functional Decision Diagrams (OKFDDs). This close relation is used to obtain the first polynomial time minimization algorithm. A generalization to partially symmetric functions is investigated. Experimental results in comparison to previously published methods are given to show the efficiency of the approach
Keywords
Boolean functions; minimisation of switching nets; symmetric switching functions; AND/EXOR form; Kronecker expression; minimization algorithm; ordered Kronecker functional decision diagram; polynomial time; symmetric function; Boolean functions; Circuit synthesis; Circuit testing; Computer science; Design for testability; Error correction; Field programmable gate arrays; Minimization methods; Polynomials; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1996. ISCAS '96., Connecting the World., 1996 IEEE International Symposium on
Conference_Location
Atlanta, GA
Print_ISBN
0-7803-3073-0
Type
conf
DOI
10.1109/ISCAS.1996.541983
Filename
541983
Link To Document