CPEN 211 Lecture Notes - Lecture 4: Karnaugh Map, Venn Diagram, Maurice Karnaugh
Document Summary
The karnaugh map is a way of simplifying of digital logic, like boolean algebra. So, we will have a combination of inputs, starting from 2 and all to the way to as many as we want. Doing the computations, making the truth tables by hand, will take a lot of time. Boolean algebra cuts through this quickly and so does another technique called karnaugh mapping. Boolean would be the faster way if the inputs are less than 2, but for inputs ranging from 2 to 7, karnaugh mapping might be a faster way. Anything over that would take automated computing power to sort. Lets discuss venn diagrams first and then relate the two concepts together. In venn diagrams, you make use of sets. Sets are anything that contain a well defined collection of elements, like the set of real numbers r = {1,2,3,4} You can have two sets, a and b, and you can map these on a venn diagram.
