You can help expand this article with text translated from the corresponding article in German. (February 2018) Click [show] for important translation instructions.
View a machine-translated version of the German article.
Machine translation, like DeepL or Google Translate, is a useful starting point for translations, but translators must revise errors as necessary and confirm that the translation is accurate, rather than simply copy-pasting machine-translated text into the English Wikipedia.
Do not translate text that appears unreliable or low-quality. If possible, verify the text with references provided in the foreign-language article.
You must provide copyright attribution in the edit summary accompanying your translation by providing an interlanguage link to the source of your translation. A model attribution edit summary is Content in this edit is translated from the existing German Wikipedia article at [[:de:Karnaugh-Veitch-Diagramm]]; see its history for attribution.
You may also add the template {{Translated|de|Karnaugh-Veitch-Diagramm}} to the talk page.
For more guidance, see Wikipedia:Translation.
Graphical method to simplify Boolean expressions
The Karnaugh(/ˈkɑːnɔː/) map (KM or K-map) is a method of simplifying Boolean algebra expressions. 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] but now with a focus set on its utility for switching circuits.[4] Veitch charts are also known as Marquand–Veitch diagrams,[4]Svoboda charts[7] -(albeit only rarely)- and even Karnaugh maps as Karnaugh–Veitch maps (KV maps).
The Karnaugh map reduces the need for extensive calculations by taking advantage of humans' pattern-recognition capability.[1] It also permits the rapid identification and elimination of potential race conditions.[clarification needed]
The required Boolean results are transferred from a truth table onto a two-dimensional grid where, in Karnaugh maps, the cells are ordered in Gray code,[8][4] and each cell position represents one combination of input conditions. Cells are also known as minterms, while each cell value represents the corresponding output value of the boolean function. Optimal groups of 1s or 0s are identified, which represent the terms of a canonical form of the logic in the original truth table.[9] These terms can be used to write a minimal Boolean expression representing the required logic.
Karnaugh maps are used to simplify real-world logic requirements so that they can be implemented using the minimal number of logic gates. A sum-of-products expression (SOP) can always be implemented using AND gates feeding into an OR gate, and a product-of-sums expression (POS) leads to OR gates feeding an AND gate. The POS expression gives a complement of the function (if F is the function so its complement will be F').[10] Karnaugh maps can also be used to simplify logic expressions in software design. Boolean conditions, as used for example in conditional statements, can get very complicated, which makes the code difficult to read and to maintain. Once minimised, canonical sum-of-products and product-of-sums expressions can be implemented directly using AND and OR logic operators.[11]
^ abCite error: The named reference Karnaugh_1953 was invoked but never defined (see the help page).
^Cite error: The named reference Curtis_1962 was invoked but never defined (see the help page).
^Cite error: The named reference Veitch_1952 was invoked but never defined (see the help page).
^ abcdeCite error: The named reference Brown_2012 was invoked but never defined (see the help page).
^Cite error: The named reference Marquand_1881 was invoked but never defined (see the help page).
^Cite error: The named reference Gardner_1958 was invoked but never defined (see the help page).
^Cite error: The named reference Klir_1972 was invoked but never defined (see the help page).
^Cite error: The named reference Wakerly_1994 was invoked but never defined (see the help page).
^Cite error: The named reference Belton_1998 was invoked but never defined (see the help page).
^Cite error: The named reference Dodge_2016 was invoked but never defined (see the help page).
^Cite error: The named reference Cook_2012 was invoked but never defined (see the help page).
The Karnaugh(/ˈkɑːnɔː/) map (KM or K-map) is a method of simplifying Boolean algebra expressions. Maurice Karnaugh introduced it in 1953 as a refinement...
(1707–1783) Venn diagram (1880) by John Venn (1834–1923) Karnaughmap (1953) by Maurice Karnaugh The same methods of Boolean expression minimization (simplification)...
most convenient of which is the Karnaughmap, to be discussed in Chapter 6."(p 64) In Chapter 6, section 6.4 "Karnaughmap representation of Boolean functions"...
dimensions are either Veitch diagrams or Karnaughmaps (these are virtually the same thing). When working with Karnaughmaps one must always keep in mind that...
mathematician, computer scientist, and inventor known for the Karnaughmap used in Boolean algebra. Karnaugh studied mathematics and physics at City College of New...
disjunctive normal form By using tables Pascal method Summation method Using a Karnaughmap Using the method of indeterminate coefficients, a linear system consisting...
mathematician, and inventor Ron Karnaugh (born 1966), American retired swimmer Karnaughmap This page lists people with the surname Karnaugh. If an internal link...
uses -. "Don't care"s are especially common in state machine design and Karnaughmap simplification. The '-' values provide additional degrees of freedom...
branches than if only analyzing for phenotypic ratio. Mendelian inheritance Karnaughmap, a similar diagram used for Boolean algebra simplification Mendel, Gregor...
semiconductor purification and level doping. In 1953, Maurice Karnaugh developed the Karnaughmap, used for managing of Boolean algebraic expressions. In January...
diagram: truth table values arranged in a two-dimensional grid (used in a Karnaughmap) Binary decision diagram, listing the truth table values at the bottom...
"diagrams are pictorial, yet abstract, representations of information, and maps, line graphs, bar charts, engineering blueprints, and architects' sketches...
group an element of a Weyl group Reflection map (logic optimization), a conventional Gray code Karnaughmap in logic optimization This disambiguation page...
Entitative graph Existential graph Laws of Form Logical graph Truth table Karnaughmap Venn diagram Boolean function Boolean-valued function Boolean-valued...
labelled is squashed into two dimensions to form either a Veitch diagram or Karnaughmap. Wikimedia Commons has media related to Hypercubes. Weisstein, Eric W...
Flip-flop (electronics) Functional completeness Integrated injection logic Karnaughmap Combinational logic List of 4000 series integrated circuits List of 7400...
transistors in fully complementary CMOS logic. XOR has the worst-case Karnaughmap—if implemented from simple gates, it requires more transistors than any...
representations as Karnaughmaps. The Karnaughmap-based minimization of logic is guided by a set of rules on how entries in the maps can be combined. A...
diagram Marquand diagram (and as further derivation Veitch chart and Karnaughmap) Spherical octahedron – A stereographic projection of a regular octahedron...
information. Wikimedia Commons has media related to Carroll diagrams. Diagram Karnaughmap Set theory Venn diagram The Game of Logic Ameis, Jerry (2010). "Venn...
manipulation Bitboard Bitwise operations in C Double dabble Find first set Karnaughmap Logic gate Logical operator Primitive data type "CMicrotek Low-power...
minimal covering sum, or Blake canonical form. Quine–McCluskey algorithm Karnaughmap Petrick's method "What are the essential prime implicants?". De Micheli...
Model checking Radix tree Barrington's theorem Hardware acceleration Karnaughmap, a method of simplifying Boolean algebra expressions Zero-suppressed...