Scribd
Upload
2 views

Lecture 7

The document outlines the K-map method for minimizing Boolean expressions in digital logic design, covering K-maps for 2, 3, and 4 variables. It details the rules for simplification, grouping of 1's, and provides examples for practice. The process includes populating the K-map, forming groups, and deriving the simplified Boolean function.

Uploaded by

acernitro88588
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Lecture 7

The document outlines the K-map method for minimizing Boolean expressions in digital logic design, covering K-maps for 2, 3, and 4 variables. It details the rules for simplification, grouping of 1's, and provides examples for practice. The process includes populating the K-map, forming groups, and deriving the simplified Boolean function.

Uploaded by

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

EE227 – Digital Logic Design

Lecture 7
Outline
• KARANUGH Map (K – Map) Method
– With 2 variables
– With 3 variables
– With 4 variables

EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 2


KARANUGH Map (K – Map)
• K – Map is a pictorial method used to
minimize Boolean expressions without
having to use Boolean algebra theorems
and equation manipulations
• It is thought as a special version of a truth
table
• Using a K-map, expressions with two to four
variables are easily minimized

EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 3


Generating K – Map (1/3)
• A k map will contain 2n squares
– Where n is the number of variables in the
expression
• While generating a k-map one should keep
in mind that any two adjacent squares in
the map differ by only one bit

EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 4


Generating K – Map (2/3)
• With two variables
y
x 0 1
x’y’ x’y
0 m0 m1
xy’ xy
1 m2 m3

• With three variables


yz
x 00 01 11 10
x’y’z’ x’y’z x’yz x’yz’
0 m0 m1 m3 m2
xy’z’ xy'z xyz xyz’
1 m4 m5 m7 m6

EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 5


Generating K – Map (2/3)
• With four variables
yz
wx 00 01 11 10

00 w’x’y’z’ w’x’y’z w’x’yz w’x’yz’


m0 m1 m3 m2

01 w’xy’z’ w’xy’z w’xyz w’xyz’


m4 m5 m7 m6

wxy’z’ wxy’z wxyz wxyz’


11
m12 m13 m15 m14

wx’y’z’ wx’y’z wx’yz wx’yz’


10 m8 m9 m11 m10

EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 6


K-Map - Rules of Simplification (1/4)

• While using k-map we group the 1’s present


in the k-map table and note the variables
which are not changing
• Here are some rules for simplification and
grouping of 1’s
– Groups may not include
any cell containing a zero
– Groups may be horizontal
or vertical, but not diagonal

EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 7


K-Map - Rules of Simplification (2/4)

• Groups must contain 1, 2, 4, 8, or in general 2n


cells

• Each group should be as large as possible

• Each cell containing a one must be in at least


one group

EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 8


K-Map - Rules of Simplification (3/4)
• 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

EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 9


K-Map - Rules of Simplification (4/4)

• There should be as few groups as possible,


as long as this does not contradict any of
the previous rules

EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 10


K – Map Simplification Steps
1. Populate the k-map
– By using truth table
– Or by using minterms
• Introduce all the variables in each term
2. Form the groups by considering the rules
3. Note the constant variables for each group
4. Multiply the constant variables of each group
to form a term
5. Add all the terms to obtain the simplified
Boolean function

EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 11


K – Map with Two Variables
Simplify the following expression by using
k-map
F = A’B + AB’ + AB
B B
A 0 1 A 0 1

0 1 0 1

1 1 1 1 1 1
For the group outlined in red, A is changing from 0 to 1, but B is constant and is 1,
so the expression for red group is B
For the group outlined in blue, B is changing from 0 to 1, but A is constant and is 1, F=A+B
so the expression for blue group is A
EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 12
K – Map with Three Variables
Simplify the following Boolean function by using k-map
F = A’B’C’ + A’B + ABC’ + AC
First complete the minterms by introducing the missing
variables in each term.
F = A’B’C’ + A’B(C + C’) + ABC’ + AC(B + B’)
F = A’B’C’ + A’BC + A’BC’ + ABC’ + ABC + AB’C
BC
A BC
00 01 11 10 A 00 01 11 10
0 1 1
0 1
1
1 1 1 1

F = B + AC + A’C’
EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 13
K – Map with Four Variables
Simplify the following Boolean function by using
k-map
F = A’B’C’ + B’CD + A’BCD’ + AB’C’
Lets first complete the mintems.
F = A’B’C’(D+D’) + B’CD(A+A’) + A’BCD’ + AB’C’(D+D’)
F = A’B’C’D + A’B’C’D’ + AB’CD + A’B’CD + A’BCD’ + AB’C’D + AB’C’D’
0 1 11 3 6 9 8
F = Σ(0, 1, 3, 6, 8, 9, 11)

EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 14


K – Map with Four Variables
F = A’B’C’D + A’B’C’D’ + AB’CD + A’B’CD + A’BCD’ + AB’C’D + AB’C’D’
F = Σ(0, 1, 3, 6, 8, 9, 11)
CD
AB

1 1 1
1

1 1 1

F = B’C’ + B’D + A’BCD’


EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 15
Example 1
Simplify the following Boolean Expression by using K-Map.
F(A,B,C,D) = Σ(0, 2, 5, 7, 8, 10, 13, 15)
CD
AB

1 1
1 1

1 1
1 1

F = BD + B’D’
EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 16
Example 2
Simplify the following Boolean function by using k-map
F = A’B’C’D’ + AC’D’ + B’CD’ + A’BCD + BC’D
Completing the minterms.
F = A’B’C’D’+ABC’D’+AB’C’D’+AB’CD’+A’B’CD’+A’BCD+ABC’D+A’BC’D
F = Σ(0,2,5,6,8,10,12,13)
CD
AB
1 1

1 1
F = B’D’ + A’BD + ABC’
1 1

1 1

EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 17


Example 3
Simplify the following Boolean function by using k-map
F(W, X, Y, Z) = (1, 4, 5, 6, 12, 14, 15)
YZ
WX

1 1 1

1 1 1

F = XZ’ + W’Y’Z + WXY


EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 18
Example 4
Simplify the following Boolean function by using k-map
F(A,B,C,D) = (2,3,4,5,6,7,8,10,12,13,14,15)
CD
AB

1 1

1 1 1 1

1 1 1 1

1 1

F = B + AD’ + A’C
EE227 - DLD Course Instructor : Muhammad Sajid Iqbal 19

You might also like