Computation of disjoint cube representations using a maximal binate variable heuristic
Proceedings of the Thirty-Fourth Southeastern Symposium on System Theory (Cat. No.02EX540) - Trang 417-421
Tóm tắt
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.
Từ khóa
#Boolean functions #Design automation #Minimization #Logic functions #Sections #Equations #Boolean algebra #Binary treesTài liệu tham khảo
10.1049/ip-cds:19990327
falkowski, 1993, Calculation of Rademacher-Walsh Spectral coefficients for systems of completely and incompletely specified Boolean functions, IEEE International Symposium on Circuits and Systems, 1698
10.1109/43.277608
hurs, 1985, Spectral Techniques in Digital Logic
10.1109/ISMVL.1993.289569
kozlowski, 1995, An enhanced algorithm for the minimization of exclusive-OR-sum-of-products for incompletely specified functions, Proceedings of IEEE International Conference on Computer Design VLSI in Computers and Processors, 224
mishchenko, 2001, Fast heuristic minimization of exclusive-sums-of-products, Proceedings of the International Workshop on Reed-Muller expansions in circuit design, 242
10.1007/978-1-4615-1425-1
brayton, 1984, Logic Minimization Algorithms for VLSI Synthesis, 10.1007/978-1-4613-2821-6
10.1109/MWSCAS.1993.343341
kozlowski, 1996, Application of exclusive-OR logic in technology independent logic optimization
falkowski, 1990, A fast computer algorithm for the generation of disjoint cubes for completely and incompletely specified Boolean functions, the 33rd Midwest Symposium on Circuits and Systems, 1119