DocumentCode :
2138226
Title :
Computation of disjoint cube representations using a maximal binate variable heuristic
Author :
Shivakumaraiah, Lokesh ; Thornton, Mitchell A.
Author_Institution :
Dept. of Electr. & Comput. Eng., Mississippi State Univ., MS, USA
fYear :
2002
fDate :
2002
Firstpage :
417
Lastpage :
421
Abstract :
A method for computing the disjoint-sum-of-products (DSOP) form of Boolean functions is described. The algorithm exploits the property of the most binate variable in a set of cubes to compute a DSOP form. The technique uses a minimized sum-of-products (SOP) cube list as input. Experimental results comparing the size of the DSOP cube list produced by this algorithm and those produced by other methods demonstrate the efficiency of this technique and show that superior results occur in many cases for a set of benchmark functions.
Keywords :
Boolean functions; minimisation; Boolean functions; binate function variables; cube list representations; disjoint-sum-of-products; minimization; multiple output functions; sum-of products; unate function variables; Binary trees; Boolean algebra; Boolean functions; Design automation; Equations; Logic functions; Minimization; Sections;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
System Theory, 2002. Proceedings of the Thirty-Fourth Southeastern Symposium on
ISSN :
0094-2898
Print_ISBN :
0-7803-7339-1
Type :
conf
DOI :
10.1109/SSST.2002.1027079
Filename :
1027079
Link To Document :
بازگشت