Open In App

Minimization of Boolean Functions

Last Updated : 25 Nov, 2019
Like Article
As discussed in the “Representation of Boolean Functions” every boolean function can be expressed as a sum of minterms or a product of maxterms. Since the number of literals in such an expression is usually high, and the complexity of the digital logic gates that implement a Boolean function is directly related to the complexity of the algebraic expression from which the function is implemented, it is preferable to have the most simplified form of the algebraic expression. The process of simplifying the algebraic expression of a boolean function is called minimization. Minimization is important since it reduces the cost and complexity of the associated circuit. For example, the function F=x^\prime y^\prime z + x^\prime yz + xy^\prime can be minimized to F=x^\prime z + xy^\prime. The circuits associated with above expressions is – It is clear from the above image that the minimized version of the expression takes a less number of logic gates and also reduces the complexity of the circuit substantially. Minimization is hence important to find the most economic equivalent representation of a boolean function. Minimization can be done using Algebraic Manipulation or K-Map method. Each method has it’s own merits and demerits.

Minimization using Algebraic Manipulation –

This method is the simplest of all methods used for minimization. It is suitable for medium sized expressions involving 4 or 5 variables. Algebraic manipulation is a manual method, hence it is prone to human error. Common Laws used in algebraic manipulation :
  1. \:A + A^\prime = 1
  2. \:A + A^\prime B = A + B
  3. \:A + AB = A
  • Example 1 – Minimize the following boolean function using algebraic manipulation- F=ABC^\prime D^\prime + ABC^\prime D + AB^\prime C^\prime D + ABCD + AB^\prime CD + ABCD^\prime \\        + AB^\prime CD^\prime
  • Solution – Properties refer to the three common laws mentioned above.

         \begin{align*} F=\:&ABC^\prime(D^\prime + D) +AB^\prime C^\prime D + ACD(B + B^\prime) &&\\ &\:+ ACD^\prime(B + B^\prime)&&\\ =\:&ABC^\prime +AB^\prime C^\prime D + ACD +ACD^\prime && \text{Using Property-1}\\ =\:&ABC^\prime +AB^\prime C^\prime D + AC(D +D^\prime )&&\\ =\:&ABC^\prime +AB^\prime C^\prime D + AC && \text{Using Property-1}\\ =\:&A(BC^\prime +C)+AB^\prime C^\prime D &&\\ =\:&A(B+C)+AB^\prime C^\prime D&& \text{Using Property-2}\\ =\:&AB +AC+AB^\prime C^\prime D &&\\ =\:&AB + AC + A C^\prime D && \text{Using Property-2}\\ =\:&AB + AC + AD && \text{Using Property-2}\\ \end{align*}

Minimization using K-Map –

The Algebraic manipulation method is tedious and cumbersome. The K-Map method is faster and can be used to solve boolean functions of upto 5 variables. Please refer this link to learn more about 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 – AB The red one spans 4 squares, which gives us – AD The blue one spans 4 squares, which gives us – AC So, the minimized boolean expression is- AB+AC+AD

GATE CS Corner Questions

Practicing the following questions will help you test your knowledge. All questions have been asked in GATE in previous years or in GATE Mock Tests. It is highly recommended that you practice them. 1. GATE CS 2012, Question 30 2. GATE CS 2007, Question 32 3. GATE CS 2014 Set-3, Question 17 4. GATE CS 2005, Question 18 5. GATE CS 2004, Question 17 6. GATE CS 2003, Question 45 7. GATE CS 2002, Question 12


K-Map – Wikipedia Digital Design, 5th edition by Morris Mano and Michael Ciletti

Like Article
Suggest improvement
Share your thoughts in the comments

Similar Reads