WWW-based Boolean function minimization
Tomaszewski, Sebastian ; Celik, Ilgaz ; Antoniou, George
International Journal of Applied Mathematics and Computer Science, Tome 13 (2003), p. 577-583 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on the Quine-McCluskey simplification technique with some modifications. The given application can be accessed on line since it is posted on the World Wide Web (WWW), with up to four variables, at the URL http://www.csam.montclair.edu/~antoniou/bs. After extensive testing, the performance of the algorithm has been found to be excellent. The proposed application is a useful aid for students and professors in the fields of electrical and computer engineering and computer science as well as a valuable tool for digital designers.

Publié le : 2003-01-01
EUDML-ID : urn:eudml:doc:207669 
@article{bwmeta1.element.bwnjournal-article-amcv13i4p577bwm,
     author = {Tomaszewski, Sebastian and Celik, Ilgaz and Antoniou, George},
     title = {WWW-based Boolean function minimization},
     journal = {International Journal of Applied Mathematics and Computer Science},
     volume = {13},
     year = {2003},
     pages = {577-583},
     zbl = {1039.94542},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-amcv13i4p577bwm}
}

Tomaszewski, Sebastian; Celik, Ilgaz; Antoniou, George. WWW-based Boolean function minimization. International Journal of Applied Mathematics and Computer Science, Tome 13 (2003) pp. 577-583. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-amcv13i4p577bwm/

[000] Bitincka L. and Antoniou G.E. (2001): Boolean function simplification on a Palm-based environment. - Proc. Int. Conf. Computing and Information Technologies, Montclair, NJ, pp. 221-228.

[001] Boole G. (1954): An Investigation of the Laws of Thought. - New York: Dover Publications. | Zbl 1205.03003

[002] Huntington E.V. (1904): Sets of independence postulates for the algebra of logic. - Trans. Amer. Math. Soc., Vol. 5, No. 3, pp. 288-309. | Zbl 35.0087.02

[003] Karnaugh M. (1953): The map method for synthesis of combinatorial logic circuits. - Trans. AIEE Comm. Electron., Vol. 72, No. 4, pp. 593-598.

[004] Katz R.H. (1994): Contemporary Logic Design. -Redwood City, CA: Benjamin Cummings.

[005] McCluskey E.J. (1956): Minimization of Boolean functions. - Bell System Tech. J., Vol. 35, No. 5, pp. 1417-1444.

[006] Mileto T. and Putzolu G. (1964): Average values of quantities appearing in Boolean function minimization. - IEEE Trans. El. Comp., Vol. 13, No. 2, pp. 87-92. | Zbl 0163.25803

[007] Mileto T. and Putzolu G. (1965): Statistical complexity of algorithms for Boolean function minimization. - J. ACM, Vol. 12, pp. 364-375. | Zbl 0139.32604

[008] Petrick S.K. (1959): On the minimization of Boolean functions. - Proc. Int. Conf. Information Processing, Paris: Unesco, pp. 422-423.

[009] Quine W.V. (1952): The problem of simplifying truth tables. - Amer. Math. Month., Vol. 59, No. 8, pp. 521-531. | Zbl 0048.24503

[010] Shannon C.E. (1938): A symbolic analysis of relay and switching circuits. - Trans. AIEE, Vol. 57, No. 6, pp. 713-723.

[011] Wegener I. (1987): The Complexity of Boolean Functions. -New York: Wiley. | Zbl 0623.94018