In: Computer Science
Show the Karnaugh map representation of the function F() =, and use it to find the minimum-cost both Sum of Product (SOP) and Product of Sum (POS) forms for the function F.
In many digital circuits and practical problems we need to find expression with minimum variables. We can minimize Boolean expressions of 3, 4 variables very easily using K-map without using any Boolean algebra theorems. K-map can take two forms Sum of Product (SOP) and Product of Sum (POS) according to the need of problem. K-map is table like representation but it gives more information than TRUTH TABLE. We fill grid of K-map with 0’s and 1’s then solve it by making groups.
Steps to solve
expression using K-map-
please give thumbs up if you like it