Karnaugh Maps
In a Karnaugh map, the variables are replaced by 1 and their complement by 0.
The procedure for simplification of the above Boolean function has been completed. We could summarize the process in the following steps:
Let's see how the Y function can be implemented with far fewer logic gates after its simplification.
It is not necessary to use a Karnaugh map for two-input logic gate functions,
Now let's look at an example with 4 variables (A, B, C and D). We will simplify the function using a Karnaugh map:
Aces that appear at the edges of the map are considered adjacent to those at the opposite edge.
Why do you use the Karnaugh map in digital circuits?
Use the following numbered positions of the output Y to complete the Karnaugh map below.
Using the given function, circle the errors in the Karnaugh map.
Use the Karnaugh map to find the minimum function from three inputs.
Use the Karnaugh map to find the minimum function from four inputs.
Place the aces on the Karnaugh map and find the simplified function.
After you have found the simplified function, draw the corresponding digital circuit.
