Karnaugh Map (K-map)
Definition - What does Karnaugh Map (K-map) mean?
A Karnaugh map (or K-map) is a graphic means of depicting Boolean functions. K-maps are used to simplify Boolean functions and expressions without using algebra-based Boolean methods.
Techopedia explains Karnaugh Map (K-map)
A K-map is another form of the truth table used by digital designers. Use of K-maps is not always simple, because the more variables are used to implement a function, the more complicated the K-map becomes, and the more difficult it is to simplify the map using the K-map technique.
Generally, a K-map is used for minimizing Boolean expressions with less than six or seven variables.
Techopedia Deals: The Complete Computer Science Bundle
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: