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:
- Boolean Algebra (Suitable when no. of variables are 2 or 3)
- K-Map (more simplified method then Boolean Algebra and suitable up to 5 & 6 variables)
- 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.
- Rate this
Current Average Ratings
Total Avg Rating: 0.00 out of 5 with based on 0 rating(s)