WWW-based Boolean function minimization

• Autorzy: Sebastian P. Tomaszewski , Ilgaz U. Celik , George E. Antoniou
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

Boolean functions; Quine-McCluskey metod; Boolean minimization; digital logic; logic design

• Wydawca: University of Zielona Gora Press
• Czasopismo: International Journal of Applied Mathematics and Computer Science
• Rocznik: 2003
• Tom: 13
• Numer: 4
• Strony: 577-583

Daty

wydano

2003

otrzymano

2002-04-09

poprawiono

2003-03-05

Twórcy

autor

Sebastian P. Tomaszewski

• BAE SYSTEMS Controls, 600 Main Street, Johnston City, NY 13790, USA

autor

Ilgaz U. Celik

• 121 Communicatins Inc., 857 Avenue of the Americas, Suite 1800, New York, NY 10001, USA

autor

George E. Antoniou

• Image Processing and Systems Laboratory Department of Computer Science, Montclair State University, Upper Montclair NJ 07043, USA

Bibliografia

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