Scribd
Upload
102 views12 pages

Karnaugh Maps: Prof Ahmed Khorsheed Al-Sulaifanie

This document covers a lecture on using Karnaugh maps to simplify Boolean algebra expressions. Karnaugh maps allow arranging variables in a table according to Gray

Uploaded by

Rayan Botany
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
102 views12 pages

Karnaugh Maps: Prof Ahmed Khorsheed Al-Sulaifanie

This document covers a lecture on using Karnaugh maps to simplify Boolean algebra expressions. Karnaugh maps allow arranging variables in a table according to Gray

Uploaded by

Rayan Botany
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Second year Class 2019- 2020

BME Department
College of Engineering
University of Dohuk

Karnaugh Maps
https://sites.google.com/a/uod.ac/digital-systems/lectures

Prof Ahmed Khorsheed Al-Sulaifanie


January 2020
Karnaugh maps
• The Karnaugh map,  the American electrical engineer Maurice Karnaugh's 1953 refinement
of Edward Veitch's 1952 Veitch diagram, is a method to simplify Boolean algebra
 expressions.
• The Karnaugh map reduces the need for extensive calculations by taking advantage of
humans' pattern-recognition capability, permitting the rapid identification.
• In a Karnaugh map the boolean variables are transferred (generally from a truth table) and
ordered according to the principles of Gray code in which only one variable changes in
between squares.
• Once the table is generated and the output possibilities are transcribed, the data is
arranged into the largest possible groups containing 2n cells (n=0,1,2,3...) and the minterm is
generated through the axiom laws of boolean algebra.
Karnaugh maps are not good for CAD (computer aided design) tools, but good for teaching the
idea of simplification.
Size of Karnaugh map
o The size of the Karnaugh map with n Boolean variables is
determined by 2n.
o Common sized maps are of 2 variables which is a 2×2 map, 3
variables which is a 2×4 map, and 4 variables which is a 4×4
map.

2 variables 3 variables
2×2 map 2×4 map
3 variables 4 variables
4x2 map 4×4 map
Karnaugh maps Combining Property

• f=Σm( ) is the symbol for the “Boolean sum” (OR) coordinates of the squares.
• In the K-map each cell, represents one minterm.
• When moving horizontally or vertically, only 1 variable changes between adjacent
squares, never 2. This property of the K-map, is unique and accounts for its
unusual numbering system.
• Any adjacent group of cells marked by value of “1” that is a power of 2 n (2n = 1, 2,
4, 8, …) can be combined into one term. The number of variables that are
eliminated is equal to n.
• In K-maps, the left and right edges are a common edge, while the top and bottom
edges are also the same edge. Thus, the top and bottom rows are adjacent, as are
the left and right columns.
Karnaugh map: Rules of Simplification
The Karnaugh map uses the following rules for the simplification of expressions
by grouping together adjacent cells containing ones

Groups may not include any cell containing a zero

Groups may be horizontal or vertical, but not diagonal. 


Karnaugh map: Rules of Simplification

Groups must contain 1, 2, 4, 8 cells or in general 2n cells. That is if n = 1, a group will


contain two 1's since 21 = 2. If n = 2, a group will contain four 1's since 22 = 4.
Karnaugh map: Rules of Simplification
Each group should be as large as possible.

• Each cell containing a one must be in at least one group.


Karnaugh map: Rules of Simplification

• Groups may overlap.

• Groups may wrap around the table. The leftmost cell in a row may be grouped with the
rightmost cell and the top cell in a column may be grouped with the bottom cell.
Karnaugh map: Rules of Simplification
• There should be as few groups as possible, as long as this does not contradict any of
the previous rules.

Rules of Simplification Summary:


1. No zeros allowed.
2. No diagonals.
3. Only power of 2 number of cells in each group.
4. Groups should be as large as possible.
5. Every one must be in at least one group.
6. Overlapping allowed.
7. Wrap around allowed.
8. Fewest number of groups possible.
How to fill a function which is not standard form in K-map

BC’D’ = A’BC’D’ + A BC’D’


and
BCD’ = A’BCD’ + A BCD’
Home work

(Q1) Use a Karnaugh map to minimize the sop function


f(x2, x1, x0) = Σm(0,4,5,6,7 )

(Q2)
Simplify the following Boolean function using Karnaugh map
z(x3,x2,x1,x0) = x0’x1’x2 + x2’x3 + x0’x1’x2’x3 + x0’x1’x2’ + x0x2x3’

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy