Tuesday, January 28, 2020
What is K-MAP and how to solve it|| KARNAUGH MAP || BCA TU NEPAL || Digital Logic ||
Karnaugh Map (K-MAP)
The K-MAP is a graphical representation that provides a systematic method for simplifying a boolean expression.
Two Variable K-MAP
For n variable k-map 2^n cells are required.Therefore for two variable k-map,2^2=4 cells are required.
 |
For constructing three variable k-map 2^3=8 cells are required.
Four Variable K-MAP
For constructing four variable k-map 2^4=16 cells are required.
Why are K-MAPS used in boolean algebra?
Karnaugh's map are used to simplify real-world logic requirements so that they can be implemented using a minimum number of physical logic gates.K-MAP reduces the need for extensive calculations by taking advantage of human's pattern recognition capability
Grouping of cells for simplification in K-MAP
Adjacent cell's which have 1's can be grouped together in 2^n powert that is:
Two adjacent cells can be grouped together
Four adjacent cells can be grouped together
Eight adjacent cells can be grouped together
Sixteen adjacent cells can be grouped together
Rules followed for K-MAP simplification
So,these are the basic information about karnaugh's map if you have any problems or confusions regarding the topic feel free to contact us.
