Karnaugh Map/ K-Map

We can simplity the logical expression using Boolen Algebra, but when the express is large and include a large number of variable. It becomes complicated to simplify these expression using Boolean Algebra, Then we use a mapping technique to simplify these logical expression called Karnaugh map (K-map).

K-Map has following properties
1. Karnaugh map can be designed for both SPOS & SSOP expression.
2. The number of cell in K-maps equal to Maxterm in POS & SOP respectively.
3. Mapping of SOP & POS expression can be done by K-Map. The presence of a Minterm in expression show the out “1”, while absence shows the logic “0”.
The presence of a Maxterm in a expression shows the output as logic “0”, while absence shows logic as logic “1”.