Semiconductor & Computer Engineering
From WikiChip
Difference between revisions of "karnaugh map"
(Created page with "{{title|Karnaugh Map (K-Map)}} '''Marnaugh Map''' ('''K-Map''') is a graphical tool that provides a simple and straightforward method of minimizing Bo...") |
|||
| Line 1: | Line 1: | ||
{{title|Karnaugh Map (K-Map)}} | {{title|Karnaugh Map (K-Map)}} | ||
'''Marnaugh Map''' ('''K-Map''') is a graphical tool that provides a simple and straightforward method of [[logic minimization|minimizing]] [[Boolean algebra|Boolean expressions]]. The K-map method was introduced in 1953 by [[Maurice Karnaugh]] as an enhancement to [[Veitch diagram]]. | '''Marnaugh Map''' ('''K-Map''') is a graphical tool that provides a simple and straightforward method of [[logic minimization|minimizing]] [[Boolean algebra|Boolean expressions]]. The K-map method was introduced in 1953 by [[Maurice Karnaugh]] as an enhancement to [[Veitch diagram]]. | ||
| + | |||
| + | |||
| + | == Map format == | ||
| + | A K-Map is a square or rectangle divided into a number of smaller squares called '''cells'''. Each cell on the K-Map corresponds directly to a line in a [[truth table]]. There are always <math>2^n</math> cells in a K-Map where <math>n</math> is the number of variables in the {{ba|function}}. | ||
Revision as of 18:51, 8 December 2015
Marnaugh Map (K-Map) is a graphical tool that provides a simple and straightforward method of minimizing Boolean expressions. The K-map method was introduced in 1953 by Maurice Karnaugh as an enhancement to Veitch diagram.
Map format
A K-Map is a square or rectangle divided into a number of smaller squares called cells. Each cell on the K-Map corresponds directly to a line in a truth table. There are always cells in a K-Map where is the number of variables in the function.