Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Example
Karnaugh maps are used to facilitate the
simplification of Boolean algebra
functions. For example, consider the
Boolean function described by the
following truth table.
Truth table of a function
A B C D
0 0 0 0 0 0
1 0 0 0 1 0
2 0 0 1 0 0
3 0 0 1 1 0
4 0 1 0 0 0
5 0 1 0 1 0
6 0 1 1 0 1
7 0 1 1 1 0
8 1 0 0 0 1
9 1 0 0 1 1
10 1 0 1 0 1
11 1 0 1 1 1
12 1 1 0 0 1
13 1 1 0 1 1
14 1 1 1 0 1
15 1 1 1 1 0
Karnaugh map
K-map drawn on a torus, and in a plane. The dot-
marked cells are adjacent.
Inverse
The inverse of a function is solved in the
same way by grouping the 0s instead.
brown: A, B
gold: A, C
blue: BCD
factor of .
Σm(1); K = A′B′
Σm(2); K = AB′
Σm(3); K = A′B
Σm(4); K = AB
Σm(1,2); K = B′
Σm(1,3); K = A′
Σm(1,4); K = A′B′ + AB
Σm(2,3); K = AB′ + A′B
Σm(2,4); K = A
Σm(3,4); K = B
Σm(1,2,3); K = A' + B′
Σm(1,2,4); K = A + B′
Σm(1,3,4); K = A′ + B
Σm(2,3,4); K = A + B
Σm(1,2,3,4); K = 1
See also
Circuit minimization
Espresso heuristic logic minimizer
List of Boolean algebra topics
Quine–McCluskey algorithm
Algebraic normal form (ANF)
Ring sum normal form (RSNF)
Zhegalkin normal form
Reed–Muller expansion
Venn diagram
Punnett square (a similar diagram in
biology)
Binary decision diagram, a data
structure that is a compressed
representation of a Boolean function
References
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, H. Allen (1962). A new
approach to the design of switching
circuits. Bell Laboratories Series.
Princeton, New Jersey, USA: D. van
Nostrand Company, Inc.
3. Veitch, Edward Westbrook (1952-05-
03) [1952-05-02]. "A Chart Method for
Simplifying Truth Functions".
Transactions of the 1952 ACM Annual
Meeting. ACM Annual
Conference/Annual Meeting:
Proceedings of the 1952 ACM Annual
Meeting (Pittsburgh, Pennsylvania,
USA). New York, USA: Association for
Computing Machinery (ACM): 127–
133. doi:10.1145/609784.609801 .
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]
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. Wakerly, John F. (1994). Digital Design:
Principles & Practices. New Jersey,
USA: Prentice Hall. pp. 222, 48–49.
ISBN 0-13-211459-3. (NB. The two
page sections taken together say that
K-maps are labeled with Gray code.
The first section says that they are
labeled with a code that changes only
one bit between entries and the
second section says that such a code
is called Gray code.)
7. Belton, David (April 1998). "Karnaugh
Maps – Rules of Simplification" .
Archived from the original on 2017-
04-18. Retrieved 2009-05-30.
8. Dodge, Nathan B. (September 2015).
"Simplifying Logic Circuits with
Karnaugh Maps" (PDF). The University
of Texas at Dallas, Erik Jonsson
School of Engineering and Computer
Science. Archived (PDF) from the
original on 2017-04-18. Retrieved
2017-04-18.
9. Cook, Aaron. "Using Karnaugh Maps to
Simplify Code" . Quantum Rarity.
Archived from the original on 2017-
04-18. Retrieved 2012-10-07.
10. Wolfram, Stephen (2002). A New Kind
of Science . Wolfram Media, Inc.
p. 1097. ISBN 1-57955-008-8.
11. Aiken, Howard H.; Blaauw, Gerrit;
Burkhart, William; Burns, Robert J.;
Cali, Lloyd; Canepa, Michele; Ciampa,
Carmela M.; Coolidge, Jr., Charles A.;
Fucarile, Joseph R.; Gadd, Jr., J. Orten;
Gucker, Frank F.; Harr, John A.;
Hawkins, Robert L.; Hayes, Miles V.;
Hofheimer, Richard; Hulme, William F.;
Jennings, Betty L.; Johnson, Stanley
A.; Kalin, Theodore; Kincaid, Marshall;
Lucchini, E. Edward; Minty, William;
Moore, Benjamin L.; Remmes, Joseph;
Rinn, Robert J.; Roche, John W.;
Sanbord, Jacquelin; Semon, Warren L.;
Singer, Theodore; Smith, Dexter; Smith,
Leonard; Strong, Peter F.; Thomas,
Helene V.; Wang, An; Whitehouse,
Martha L.; Wilkins, Holly B.; Wilkins,
Robert E.; Woo, Way Dong; Little, Elbert
P.; McDowell, M. Scudder (1952)
[January 1951]. "Chapter V: Minimizing
charts". Synthesis of electronic
computing and control circuits
(second printing, revised ed.). Write-
Patterson Air Force Base: Harvard
University Press (Cambridge,
Massachusetts, USA) / Geoffrey
Cumberlege Oxford University Press
(London). pp. preface, 50–67.
Retrieved 2017-04-16. "[…] Martha
Whitehouse constructed the
minimizing charts used so profusely
throughout this book, and in addition
prepared minimizing charts of seven
and eight variables for experimental
purposes. […] Hence, the present writer
is obliged to record that the general
algebraic approach, the switching
function, the vacuum-tube operator,
and the minimizing chart are his
proposals, and that he is responsible
for their inclusion herein. […]" (NB.
Work commenced in April 1948.)
12. Phister, Jr., Montgomery (1959)
[December 1958]. Logical design of
digital computers . New York, USA:
John Wiley & Sons Inc. pp. 75–83.
ISBN 0-47168805-3.
13. Svoboda, Antonín (1956). Graficko-
mechanické pomůcky užívané při
analyse a synthese kontaktových
obvodů [Utilization of graphical-
mechanical aids for the analysis and
synthesis of contact circuits]. Stroje na
zpracování informací [Symphosium IV
on information processing machines]
(in Czech). IV. Prague: Czechoslovak
Academy of Sciences, Research
Institute of Mathematical Machines.
pp. 9–21.
14. Svoboda, Antonín (1956). Graphical
Mechanical Aids for the Synthesis of
Relay Circuits. Nachrichtentechnische
Fachberichte (NTF), Beihefte der
Nachrichtentechnischen Zeitschrift
(NTZ). Braunschweig, Germany:
Vieweg-Verlag.
15. Steinbuch, Karl W.; Weber, Wolfgang;
Heinemann, Traute, eds. (1974) [1967].
Taschenbuch der Informatik - Band II -
Struktur und Programmierung von
EDV-Systemen. Taschenbuch der
Nachrichtenverarbeitung (in German).
2 (3 ed.). Berlin, Germany: Springer-
Verlag. pp. 25, 62, 96, 122–123, 238.
ISBN 3-540-06241-6. LCCN 73-80607 .
16. Svoboda, Antonín; White, Donnamaie
E. (2016) [1979-08-01]. Advanced
Logical Circuit Design Techniques
(PDF) (retyped electronic reissue ed.).
Garland STPM Press (original issue) /
WhitePubs (reissue). ISBN 978-0-8240-
7014-4. Archived (PDF) from the
original on 2017-04-14. Retrieved
2017-04-15. [2] [3]
17. Händler, Wolfgang (1958). Ein
Minimisierungsverfahren zur Synthese
von Schaltkreisen
(Minimisierungsgraphen)
(Dissertation) (in German). Technische
Hochschule Darmstadt. D 17. [4] (NB.
Although written by a German, the title
contains an anglicism; the correct
German term would be "Minimierung"
instead of "Minimisierung".)
18. Händler, Wolfgang (2013) [1961]. "Zum
Gebrauch von Graphen in der
Schaltkreis- und Schaltwerktheorie". In
Peschl, Ernst Ferdinand; Unger, Heinz
(eds.). Colloquium über Schaltkreis-
und Schaltwerk-Theorie -
Vortragsauszüge vom 26. bis 28.
Oktober 1960 in Bonn - Band 3 von
Internationale Schriftenreihe zur
Numerischen Mathematik
[International Series of Numerical
Mathematics] (ISNM) (in German). 3.
Institut für Angewandte Mathematik,
Universität Saarbrücken, Rheinisch-
Westfälisches Institut für
Instrumentelle Mathematik: Springer
Basel AG / Birkhäuser Verlag Basel.
pp. 169–198. doi:10.1007/978-3-0348-
5770-3 . ISBN 978-3-0348-5771-0. [5]
19. Berger, Erich R.; Händler, Wolfgang
(1967) [1962]. Steinbuch, Karl W.;
Wagner, Siegfried W. (eds.).
Taschenbuch der
Nachrichtenverarbeitung (in German)
(2 ed.). Berlin, Germany: Springer-
Verlag OHG. pp. 64, 1034–1035, 1036,
1038. LCCN 67-21079 . Title No. 1036.
"[…] Übersichtlich ist die Darstellung
nach Händler, die sämtliche Punkte,
numeriert nach dem Gray-Code […], auf
dem Umfeld eines Kreises anordnet.
Sie erfordert allerdings sehr viel Platz.
[…] [Händler's illustration, where all
points, numbered according to the
Gray code, are arranged on the
circumference of a circle, is easily
comprehensible. It needs, however, a
lot of space.]"
20. Hotz, Günter (1974). Schaltkreistheorie
[Switching circuit theory]. DeGruyter
Lehrbuch (in German). Walter de
Gruyter & Co. p. 117. ISBN 3-11-00-
2050-5. "[…] Der Kreisgraph von
Händler ist für das Auffinden von
Primimplikanten gut brauchbar. Er hat
den Nachteil, daß er schwierig zu
zeichnen ist. Diesen Nachteil kann
man allerdings durch die Verwendung
von Schablonen verringern. […] [The
circle graph by Händler is well suited
to find prime implicants. A
disadvantage is that it is difficult to
draw. This can be remedied using
stencils.]"
21. "Informatik Sammlung Erlangen
(ISER)" (in German). Erlangen,
Germany: Friedrich-Alexander
Universität. 2012-03-13. Archived from
the original on 2017-05-16. Retrieved
2017-04-12. (NB. Shows a picture of a
Kreisgraph by Händler.)
22. "Informatik Sammlung Erlangen (ISER)
- Impressum" (in German). Erlangen,
Germany: Friedrich-Alexander
Universität. 2012-03-13. Archived
from the original on 2012-02-26.
Retrieved 2017-04-15. (NB. Shows a
picture of a Kreisgraph by Händler.)
23. Zemanek, Heinz (2013) [1990].
"Geschichte der Schaltalgebra"
[History of circuit switching algebra].
In Broy, Manfred (ed.). Informatik und
Mathematik [Computer Sciences and
Mathematics] (in German). Springer-
Verlag. pp. 43–72. ISBN 978-3-
64276677-0. "Einen Weg besonderer
Art, der damals zu wenig beachtet
wurde, wies W. Händler in seiner
Dissertation […] mit einem
Kreisdiagramm. […]" [6] (NB.
Collection of papers at a colloquium
held at the Bayerische Akademie der
Wissenschaften, 1989-06-12/14, in
honor of Friedrich L. Bauer.)
24. Bauer, Friedrich Ludwig; Wirsing,
Martin (March 1991). Elementare
Aussagenlogik (in German). Berlin /
Heidelberg: Springer-Verlag. pp. 54–
56, 71, 112–113, 138–139. ISBN 978-
3-540-52974-3. "[…] handelt es sich um
ein Händler-Diagramm […], mit den
Würfelecken als Ecken eines 2m-gons.
[…] Abb. […] zeigt auch Gegenstücke
für andere Dimensionen. Durch
waagerechte Linien sind dabei Tupel
verbunden, die sich nur in der ersten
Komponente unterscheiden; durch
senkrechte Linien solche, die sich nur
in der zweiten Komponente
unterscheiden; durch 45°-Linien und
135°-Linien solche, die sich nur in der
dritten Komponente unterscheiden
usw. Als Nachteil der Händler-
Diagramme wird angeführt, daß sie
viel Platz beanspruchen. […]"
25. Kortum, Herbert (1965). "Minimierung
von Kontaktschaltungen durch
Kombination von Kürzungsverfahren
und Graphenmethoden" [Minimization
of contact circuits by combination of
reduction procedures and graphical
methods]. messen-steuern-regeln
(msr) (in German). Verlag Technik. 8
(12): 421–425. ISSN 0026-0347 .
CODEN MSRGAN. [7]
26. Kortum, Herbert (1966). "Konstruktion
und Minimierung von
Halbleiterschaltnetzwerken mittels
Graphentransformation" . messen-
steuern-regeln (msr) (in German).
Verlag Technik. 9 (1): 9–12.
ISSN 0026-0347 . CODEN MSRGAN.
27. Kortum, Herbert (1966). "Weitere
Bemerkungen zur Minimierung von
Schaltnetzwerken mittels
Graphenmethoden" . messen-steuern-
regeln (msr) (in German). Verlag
Technik. 9 (3): 96–102. ISSN 0026-
0347 . CODEN MSRGAN.
28. Kortum, Herbert (1966). "Weitere
Bemerkungen zur Behandlung von
Schaltnetzwerken mittels Graphen.
Konstruktion von vermaschten
Netzwerken (Brückenschaltungen)"
[Further remarks on treatment of
switching networks by means of
graphs]. messen-steuern-regeln (msr)
(in German). Verlag Technik. 9 (5):
151–157. ISSN 0026-0347 .
CODEN MSRGAN. Kortum, Herbert
(1965). "Weitere Bemerkungen zur
Behandlung von Schaltnetzwerken
mittels Graphen" [Further remarks on
treatment of switching networks by
means of graphs]. Regelungstechnik
(in German). 10. Internationales
Wissenschaftliches Kolloquium,
Ilmenau. Technische Hochschule. 10
(5): 33–39.
29. Kortum, Herbert (1967). "Über
zweckmäßige Anpassung der
Graphenstruktur diskreter Systeme an
vorgegebene Aufgabenstellungen".
messen-steuern-regeln (msr) (in
German). Verlag Technik. 10 (6): 208–
211. ISSN 0026-0347 .
CODEN MSRGAN.
30. Kortum, Herbert (1966). "Zur
Minimierung von Schaltsystemen"
[Minimization of switching circuits].
Wissenschaftliche Zeitschrift der TU
Ilmenau (in German). Jena:
Technische Hochschule für
Elektrotechnik Ilmenau /
Forschungsstelle für Meßtechnik und
Automatisierung der Deutschen
Akademie der Wissenschaften. 12 (2):
181–186.
31. Tafel, Hans Jörg (1971). "4.3.5.
Graphenmethode zur Vereinfachung
von Schaltfunktionen". Written at
RWTH, Aachen, Germany. Einführung
in die digitale Datenverarbeitung
[Introduction to digital information
processing] (in German). Munich,
Germany: Carl Hanser Verlag. pp. 98–
105, 107–113. ISBN 3-446-10569-7.
Further reading
Katz, Randy Howard (1998) [1994].
Contemporary Logic Design . The
Benjamin/Cummings Publishing
Company. pp. 70–85. doi:10.1016/0026-
2692(95)90052-7 . ISBN 0-8053-2703-7.
Vingron, Shimon Peter (2004) [2003-11-
05]. "Karnaugh Maps". Switching Theory:
Insight Through Predicate Logic. Berlin,
Heidelberg, New York: Springer-Verlag.
pp. 57–76. ISBN 3-540-40343-4.
Wickes, William E. (1968). Logic Design
with Integrated Circuits. New York, USA:
John Wiley & Sons. pp. 36–49. LCCN 68-
21185 . "A refinement of the Venn
diagram in that circles are replaced by
squares and arranged in a form of
matrix. The Veitch diagram labels the
squares with the minterms. Karnaugh
assigned 1s and 0s to the squares and
their labels and deduced the numbering
scheme in common use."
Maxfield, Clive "Max" (2006-11-29).
"Reed-Muller Logic" . Logic 101.
EETimes. Part 3. Archived from the
original on 2017-04-19. Retrieved
2017-04-19.
Lind, Larry Frederick; Nelson, John
Christopher Cunliffe (1977). "Section
2.3". Analysis and Design of Sequential
Digital Systems . Macmillan Press.
ISBN 0-33319266-4. (146 pages)
External links
Karnaugh map
at Wikipedia's sister projects
Definitions
from
Wiktionary
Media
from
Wikimedia
Commons
News from
Wikinews
Quotations
from
Wikiquote
Texts from
Wikisource
Textbooks
from
Wikibooks
Resources
from
Wikiversity
Retrieved from
"https://en.wikipedia.org/w/index.php?
title=Karnaugh_map&oldid=912951339"