Karnaugh map

An example Karnaugh map. This image actually shows two Karnaugh maps: for the function ƒ, using minterms (colored rectangles) and for its complement, using maxterms (gray rectangles). In the image, E() signifies a sum of minterms, denoted in the article as .

A Karnaugh map (KM or K-map) is a diagram that can be used to simplify a Boolean algebra expression. Maurice Karnaugh introduced it in 1953[1][2] as a refinement of Edward W. Veitch's 1952 Veitch chart,[3][4] which itself was a rediscovery of Allan Marquand's 1881 logical diagram[5][6] (aka. Marquand diagram[4]). It is also useful for understanding logic circuits.[4] Karnaugh maps are also known as Marquand–Veitch diagrams,[4] Svoboda charts[7] -(albeit only rarely)- and Karnaugh–Veitch maps (KV maps).

  1. ^ Cite error: The named reference Karnaugh_1953 was invoked but never defined (see the help page).
  2. ^ Cite error: The named reference Curtis_1962 was invoked but never defined (see the help page).
  3. ^ Cite error: The named reference Veitch_1952 was invoked but never defined (see the help page).
  4. ^ a b c d Cite error: The named reference Brown_2012 was invoked but never defined (see the help page).
  5. ^ Cite error: The named reference Marquand_1881 was invoked but never defined (see the help page).
  6. ^ Cite error: The named reference Gardner_1958 was invoked but never defined (see the help page).
  7. ^ Cite error: The named reference Klir_1972 was invoked but never defined (see the help page).