Minimization of Boolean Functions

Minimization using Algebraic Manipulation –

• Example 1 – Minimize the following boolean function using algebraic manipulation-
• Solution – Properties refer to the three common laws mentioned above.

     

Minimization using K-Map –

• Example 2 – Consider the same expression from example-1 and minimize it using K-Map.
• Solution – The following is a 4 variable K-Map of the given expression. The above figure highlights the prime implicants in green, red and blue. The green one spans the whole third row, which gives us – The red one spans 4 squares, which gives us – The blue one spans 4 squares, which gives us – So, the minimized boolean expression is-

GATE CS Corner Questions

References-