Examples on Minimization using 4 Variable K Map 2 | Lesson 65 | Digital Electronics |Learning Monkey

1.1K views on YouTube

Wisdomers - Computer Science and Engineering 154 tutorials here

Electronics

Here we will solve some Examples on Minimization using 4 Variable K Map 2.
In K map k stands for the karnaugh.
The K Map method provides a simple and straight forward procedure for minimizing the boolean function.
By using the K Map method we will arrive at the minimum possible solution.
The K Map is another form of Truth Table.

The map is a diagram made of squares. The design of the map changes with the number of variables in the function.
Each square is meant to be filled with the corresponding term (Minterm or Maxterm).
The boolean function is recognized graphically in the map from the area enclosed by those squares whose terms are included in the function.
In canonical SOP the square representing the minterm is filled with 1.
In canonical POS the square representing the maxterm is filled with 0.
Represent all the minterms in the boolean expression on the k map.
Identify all the subcubes.
What is meant by subcube?
Collection f 2^m cells where each cell adjacent to m cells of the collection.
Identify the largest possible subcube.
For each subcube identify the variable with the same values and remove the variables with the different values.
Every subcube can reduce “n-m” literals.
n is the number of variables in the boolean function.

Link for playlists:
https://www.youtube.com/channel/UCl8x4Pn9Mnh_C1fue-Yndig/playlists

Link for our website: https://learningmonkey.in

Mail us @ learningmonkey01@gmail.com