In this video you will learn about making K-Map of-
1. 2-variables K-Map,
2. 3-variables K-Map and
3. 4-variables K-Map,
4. SOP & POS form simplification,
5. don’t care conditions

K-Map is one method to simplify boolean expression, what are the other methods to simplify boolean expression?
There are three methods which are used for the simplification or minimization of Boolean expression:
  1. Boolean Algebra (Suitable when no. of variables are 2 or 3)
  2. K-Map (more simplified method then Boolean Algebra and suitable up to 5 & 6 variables)
  3. Tabular Method or Quine- McCluskey (Suitable when no .of variable are more 5 &6)
What do we simplify boolean expressions?
We simplify Boolean expression to reduce the hardware requirement during the circuit implementation. Smaller expression will require less no of gate or Hardware.
How's this tutorial?
Easy0
Difficult0
I can live without food but I can't live without teaching. I passionate about my profession. Raj Kumar Thenua, M.Tech in Digital Communication, GATE 2015 & NET 2014 Qualified, currently working as an Assistant Professor at Anand Engineering College, Agra. He has an experience of approx 10 years in academics. The areas of interest are Communication, Signal Processing, and Adaptive filters. He has received a “Shrestha Shikshak Puruskar” by Sharda Group of Institutions (SGI) in the year 2009-10 for outstanding academic performance He has the knowledge of various Engineering simulation software’s mainly MATLAB, Simulink, IE3D, Scilab, Code composer Studio. He is the active member of IETE, ISTE, IAENG, IACSIT, UACEE.

LEAVE A REPLY

Please enter your comment!
Please enter your name here