Title :
Exact minimisation of Kronecker expressions for symmetric functions
Author :
Becker, B. ; Drechsler, R.
Author_Institution :
Inst. of Comput. Sci., Albert-Ludwigs-Univ., Freiburg, Germany
fDate :
11/1/1996 12:00:00 AM
Abstract :
In the paper, an algorithm for the exact minimisation 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 a polynomial time minimisation algorithm. A generalisation 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; computational complexity; diagrams; directed graphs; logic CAD; AND/EXOR forms; Boolean fuctions; Kronecker expression exact minimisation; directed graph; logic design; ordered Kronecker functional decision diagrams; partially symmetric functions; polynomial time minimisation algorithm; totally symmetric functions;
Journal_Title :
Computers and Digital Techniques, IEE Proceedings -
DOI :
10.1049/ip-cdt:19960787
