Uploaded December 2021 | Updated September 2026, 3 weeks ago
In this video, the minimization of the Boolean expression using the K-map is explained with different examples.
The following topics are covered in the video:
0:00 Introduction
2:00 Construction of 2 and 3 Variable K-map
5:16 Mapping of Boolean Function on K-map
6:50 2-Variable K-map (Boolean Function Minimization)
11:20 3-Variable K-map (Boolean Function Minimization)
Karnaugh Map (K-map)
The Karnaugh Map is a technique for simplifying the Boolean function.
2-Variable K-map:
The 2-Variable K-map consists of 2x2 cells. Each cell of the map represents a particular minterm.
During the mapping of the function in the K-map, the minterms which are present in the function are represented as '1' in the map.
3- Variable K-map:
The 3-Variable K-map consists of 4x2 cells. Each cell of the map represents a particular minterm.
During the mapping of the function in the K-map, the minterms which are present in the function are represented as '1' in the map.
The cells in the K-map are arranged such that, the two adjacent cells of the map differ by only 1 bit.
Boolean Function Minimization using K-map (Rules):
1) By grouping the '1's in the map, it is possible to minimize the function.
2) The group of '1's should be in the power of 2. (i.e the group size should be 2, 4, 8, etc).
3) The shape of the group can be either square or rectangle.
4) During the minimization and grouping, just ensure that all the 1's in the map get covered.
5) During Minimization, the overlapping of the group is allowed.
In this video, the minimization of 2-variable and 3-variable functions using the K-map is explained with different examples.
This video will be helpful to all the students of science and engineering in understanding the Karnaugh Map (K-map) and how to minimize any Boolean expression using K-map.
#ALLABOUTELECTRONICS
#Kmap
Support the channel through membership program:
youtube.com/channel/UCBkOVp1Cqz4MR0LYR8vKpZg/join
--------------------------------------------------------------------------------------------------
Follow my second channel:
youtube.com/channel/UCGA2TO8ylVqFHpucwn_6Jlw
Follow me on Facebook:
facebook.com/ALLABOUTELECRONICS
Follow me on Instagram:
instagram.com/all_about.electronics
--------------------------------------------------------------------------------------------------
Music Credit: bensound.com
In this video, the minimization of the Boolean expression using the K-map is explained with different examples.
The following topics are covered in the video:
0:00 Introduction
2:00 Construction of 2 and 3 Variable K-map
5:16 Mapping of Boolean Function on K-map
6:50 2-Variable K-map (Boolean Function Minimization)
11:20 3-Variable K-map (Boolean Function Minimization)
Karnaugh Map (K-map)
The Karnaugh Map is a technique for simplifying the Boolean function.
2-Variable K-map:
The 2-Variable K-map consists of 2x2 cells. Each cell of the map represents a particular minterm.
During the mapping of the function in the K-map, the minterms which are present in the function are represented as '1' in the map.
3- Variable K-map:
The 3-Variable K-map consists of 4x2 cells. Each cell of the map represents a particular minterm.
During the mapping of the function in the K-map, the minterms which are present in the function are represented as '1' in the map.
The cells in the K-map are arranged such that, the two adjacent cells of the map differ by only 1 bit.
Boolean Function Minimization using K-map (Rules):
1) By grouping the '1's in the map, it is possible to minimize the function.
2) The group of '1's should be in the power of 2. (i.e the group size should be 2, 4, 8, etc).
3) The shape of the group can be either square or rectangle.
4) During the minimization and grouping, just ensure that all the 1's in the map get covered.
5) During Minimization, the overlapping of the group is allowed.
In this video, the minimization of 2-variable and 3-variable functions using the K-map is explained with different examples.
This video will be helpful to all the students of science and engineering in understanding the Karnaugh Map (K-map) and how to minimize any Boolean expression using K-map.
#ALLABOUTELECTRONICS
#Kmap
Support the channel through membership program:
youtube.com/channel/UCBkOVp1Cqz4MR0LYR8vKpZg/join
--------------------------------------------------------------------------------------------------
Follow my second channel:
youtube.com/channel/UCGA2TO8ylVqFHpucwn_6Jlw
Follow me on Facebook:
facebook.com/ALLABOUTELECRONICS
Follow me on Instagram:
instagram.com/all_about.electronics
--------------------------------------------------------------------------------------------------
Music Credit: bensound.com
