A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Computation of disjoint cube representations using a maximal binate variable heuristic
Proceedings of the Thirty-Fourth Southeastern Symposium on System Theory (Cat. No.02EX540)
Preserved Fulltext
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.
doi:10.1109/ssst.2002.1027079
fatcat:253f3k63dfh3beyurn7wonzr2e