Boolean Simplification using K-Map (Step-by-Step)

This video explains the K-Map simplification procedure step by step if the given Boolean function is in SOP form and in POS form.

Karnaugh Map Introduction:    • Karnaugh Map | Introduction (Basic)  

Boolean Simplification using Boolean laws:    • Simplification Of Boolean Expressions | Us...  

K-Map Rules for grouping of cells:    • Karnaugh Map Simplification Rules | Groupi...  

K-Map Simplification in SOP form
------------------------------------------------------

Step 1: Select the K-map according to the number of variables given in the Boolean expression or function.

Step 2: Identify whether the given Boolean function denotes minterms or maxterms.

Step 3: Put 1’s in blocks of K-map respective to the minterms (0’s elsewhere).

Step 4: Make groups (total terms in powers of 2), trying to cover as many elements as possible in a single group.

Step 5: From the groups created, find the product terms and then sum them up for the SOP form.

K-Map Simplification in SOP form
------------------------------------------------------

Step 1: Select the K-map according to the number of variables given in the Boolean expression or function.

Step 2: Identify whether the given Boolean function denotes minterms or maxterms.

Step 3: Put 0’s in blocks of K-map respective to the maxterms (1’s elsewhere).

Step 4: Make groups (total terms in powers of 2), trying to cover as many elements as possible in a single group.

Step 5: From the groups created, find the sum terms and then multiply them up for the POS form.

Please subscribe to our channel for more computer tutorials : #cspictorial