⏾ Concept Map

K-Map ○꠹ Entries

↩ 🔵 🔵 🔵

Primary

၊၊||၊|။

K-Map ○꠹｜Definition｜1st｜20251119205401-00-⌔

Karnaugh map - Wikipedia

Karnaugh map

🖼️ ➺

A Karnaugh map (KM or K-map) is a diagram that can be used to simplify a Boolean algebra expression. Maurice Karnaugh introduced the technique in 195312 as a refinement of Edward W. Veitch’s 1952 Veitch chart,34 which itself was a rediscovery of Allan Marquand’s 1881 logical diagram56 or Marquand diagram.4 They are also known as Marquand–Veitch diagrams,4 Karnaugh–Veitch (KV) maps, and (rarely) Svoboda charts.7 An early advance in the history of formal logic methodology, Karnaugh maps remain relevant in the digital age, especially in the fields of logical circuit design and digital engineering.4

Printed 2026-06-28.

(echo:: @ ᯤ)

Footnotes

  1. Karnaugh, Maurice (November 1953) [1953-04-23, 1953-03-17]. “The Map Method for Synthesis of Combinational Logic Circuits” (PDF). Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics. 72 (5): 593–599. doi:10.1109/TCE.1953.6371932. Paper 53-217. Archived from the original (PDF) on 2017-04-16. Retrieved 2017-04-16. (NB. Also contains a short review by Samuel H. Caldwell.) ↩

  2. Curtis, Herbert Allen (1962). A new approach to the design of switching circuits. The Bell Laboratories Series (1 ed.). Princeton, New Jersey, USA: D. van Nostrand Company, Inc. ISBN 0-44201794-4. OCLC 1036797958. S2CID 57068910. ISBN 978-0-44201794-1. ark:/13960/t56d6st0q. (viii+635 pages) (NB. This book was reprinted by Chin Jih in 1969.) ↩

  3. Veitch, Edward Westbrook (1952-05-03) [1952-05-02]. “A chart method for simplifying truth functions”. Proceedings of the 1952 ACM national meeting (Pittsburgh) on - ACM ‘52. New York, USA: Association for Computing Machinery. pp. 127–133. doi:10.1145/609784.609801. S2CID 17284651. ↩

  4. Brown, Frank Markham (2012) [2003, 1990]. Boolean Reasoning - The Logic of Boolean Equations (reissue of 2nd ed.). Mineola, New York: Dover Publications, Inc. ISBN 978-0-486-42785-0. [1] ↩ ↩2 ↩3 ↩4

  5. Marquand, Allan (1881). “XXXIII: On Logical Diagrams for n terms”. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science. 5. 12 (75): 266–270. doi:10.1080/14786448108627104. Retrieved 2017-05-15. (NB. Quite many secondary sources erroneously cite this work as “A logical diagram for n terms” or “On a logical diagram for n terms”.) ↩

  6. Gardner, Martin (1958). “6. Marquand’s Machine and Others”. Logic Machines and Diagrams (1 ed.). New York, USA: McGraw-Hill Book Company, Inc. pp. 104–116. ISBN 1-11784984-8. LCCN 58-6683. ark:/13960/t5cc1sj6b. (x+157 pages) ↩

  7. Klir, George Jiří (May 1972). “Reference Notations to Chapter 2”. Introduction to the Methodology of Switching Circuits (1 ed.). Binghamton, New York, USA: Litton Educational Publishing, Inc./D. van Nostrand Company. p. 84. ISBN 0-442-24463-0. LCCN 72-181095. C4463-000-3. (xvi+573+1 pages) ↩

Link to original

Secondary

• • •