WWW-based Boolean function minimization

Sebastian Tomaszewski; Ilgaz Celik; George Antoniou

International Journal of Applied Mathematics and Computer Science (2003)

  • Volume: 13, Issue: 4, page 577-583
  • ISSN: 1641-876X

Abstract

top
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.

How to cite

top

Tomaszewski, Sebastian, Celik, Ilgaz, and Antoniou, George. "WWW-based Boolean function minimization." International Journal of Applied Mathematics and Computer Science 13.4 (2003): 577-583. <http://eudml.org/doc/207669>.

@article{Tomaszewski2003,
abstract = {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.},
author = {Tomaszewski, Sebastian, Celik, Ilgaz, Antoniou, George},
journal = {International Journal of Applied Mathematics and Computer Science},
keywords = {Boolean functions; Quine-McCluskey metod; Boolean minimization; digital logic; logic design; Quine-McCluskey method},
language = {eng},
number = {4},
pages = {577-583},
title = {WWW-based Boolean function minimization},
url = {http://eudml.org/doc/207669},
volume = {13},
year = {2003},
}

TY - JOUR
AU - Tomaszewski, Sebastian
AU - Celik, Ilgaz
AU - Antoniou, George
TI - WWW-based Boolean function minimization
JO - International Journal of Applied Mathematics and Computer Science
PY - 2003
VL - 13
IS - 4
SP - 577
EP - 583
AB - 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.
LA - eng
KW - Boolean functions; Quine-McCluskey metod; Boolean minimization; digital logic; logic design; Quine-McCluskey method
UR - http://eudml.org/doc/207669
ER -

References

top
  1. 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. 
  2. Boole G. (1954): An Investigation of the Laws of Thought. - New York: Dover Publications. Zbl1205.03003
  3. Huntington E.V. (1904): Sets of independence postulates for the algebra of logic. - Trans. Amer. Math. Soc., Vol. 5, No. 3, pp. 288-309. Zbl35.0087.02
  4. Karnaugh M. (1953): The map method for synthesis of combinatorial logic circuits. - Trans. AIEE Comm. Electron., Vol. 72, No. 4, pp. 593-598. 
  5. Katz R.H. (1994): Contemporary Logic Design. -Redwood City, CA: Benjamin Cummings. 
  6. McCluskey E.J. (1956): Minimization of Boolean functions. - Bell System Tech. J., Vol. 35, No. 5, pp. 1417-1444. 
  7. 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. Zbl0163.25803
  8. Mileto T. and Putzolu G. (1965): Statistical complexity of algorithms for Boolean function minimization. - J. ACM, Vol. 12, pp. 364-375. Zbl0139.32604
  9. Petrick S.K. (1959): On the minimization of Boolean functions. - Proc. Int. Conf. Information Processing, Paris: Unesco, pp. 422-423. 
  10. Quine W.V. (1952): The problem of simplifying truth tables. - Amer. Math. Month., Vol. 59, No. 8, pp. 521-531. Zbl0048.24503
  11. Shannon C.E. (1938): A symbolic analysis of relay and switching circuits. - Trans. AIEE, Vol. 57, No. 6, pp. 713-723. 
  12. Wegener I. (1987): The Complexity of Boolean Functions. -New York: Wiley. Zbl0623.94018

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.