Most undergraduate computer science programs require the study of digital logic. Besides just understanding how a digital computer works, it is also important to understand how digital circuits can be simplified so that they will be faster and cost less. A couple of ways to do this is by using Boolean Algegra and Karnaugh Maps. The Java program on this web page will allow the user to simplify Boolean expression that have up to five variables. This can be used to check your work to see if you obtain the same answers when you try to simplify Boolean expression on your own. This is particularly important when you do some of the laboratories. Make certain you have the correct functions before starting on the lab itself.

In some cases the simplified Boolean expressions are not unique. This program presents one answer. For the case when there is not a unique answer the number of terms and the number of variables they contain should be identical, but the terms themselves may be different.

This program allows the user to simplify Boolean/binary function expressions. Click one of the radio keys: Keyboard input, Karnaugh input or Truthtable input and then click the OK button. The three methods of input are: You may not have a Java enabled browser. You can obtain a Netscape enabled browser by contacting Netscape. The Java code for this page was completed on September 13, 1998. It has been been tested, but not exhaustively. I have found a couple of mistakes and they have all been corrected. I am fairly confident that it now works correctly. Currently one can type in 5 variables using the Keyboard input or the truthtable input. I haven't figured out how to allow the user to input 5 variables when using the Karnaugh map
Soon a paper discussing the algorithm can be reached using this link: An Algorithm for Simplifying Digital Functions
Date Page last modified and links checked: September 13, 1998
1996 The University of Northern Colorado - All Rights Reserved.
Contact for information or Technical Questions on this page: