Karnaugh Mapping (K-Mapping)
Definition - What does Karnaugh Mapping (K-Mapping) mean?
Karnaugh mapping (K-mapping) is the process of forming a pictorial map used to reduce a Boolean expression, forming a resultant with a fewer number of literals (logical operations) and variables. K-mapping can be similar to drawing a truth table whereby each variable's state is shown in every possible combination with other variables. This way, common variables can be grouped together to optimize the actual equation.
Techopedia explains Karnaugh Mapping (K-Mapping)
Maurice Karnaugh devised the Karnaugh mapping technique in 1953. It involves the grouping of expressions with conjoint terms and literals together, hence eliminating unwanted variables, to get an optimized resulting function. K-mapping is most used where the number of variables involved are to be minimized. Similarly, the number of operations can also be reduced using K-mapping. The expression can be depicting a real-time situation problem or case studies. Expressions involving five to six variables are comparatively tough but realizable, whereas expressions having seven or more variables are very difficult (if not impossible) to optimize using K-mapping.
Join thousands of others with our weekly newsletter
The 4th Era of IT Infrastructure: Superconverged Systems:
Approaches and Benefits of Network Virtualization:
Free E-Book: Public Cloud Guide:
Free Tool: Virtual Health Monitor:
Free 30 Day Trial – Turbonomic: