Ha ha ha you you in the last lecture we introduced you to the map method of boolean simplification we do a karnaugh map which is a graphical representation of a truth table filled this graph it once correspond to the cells for which whose midterms had a output true and zeroes of course we didn't mark zeros to avoid cluttering at the map wherever we did not mark a1 in the map the end device is which is purposely left out so that the map doesn't get cluttered we the object is to identify groups of ones as large as possible of course with the satisfying the adjacency rule and remove or knock off as many variables as possible so that by repeatedly doing this we can get a simpler representation of a given boolean function so we look at a few more examples today some special cases and all that I will take an example of a map like this four variables we call this variable the ABCD Pradas alias web has once in the following cells is the Battle of once that means this is a function which is X plus the sum of the following min terms this is min term number two so you got started from here 1 2 3 2 4 5 6 7 8 9 10 11 12 13 14 15 right this is the map now the idea is to group adjacent ones with as large groups as possible keeping in mind the group should be as large as possible if we have a smaller group which can be totally submerged in the larger group we should not consider the smaller group and we have to make sure that all ones are covered and we do not mind a 1 being...

## Award-winning PDF software

### Video instructions and help with filling out and completing When Form 5495 Minimizing

### Instructions and Help about When Form 5495 Minimizing

If you believe that this page should be taken down, please follow our DMCA take down process here.