0% found this document useful (0 votes)
89 views69 pages

Karnough Maps (K - Maps) & Tabular Method: Mrs. Chami Muthugamage B.Sc. (Hons) in MIS, MBA Consultant/ Lecturer NIBM

The document discusses Karnaugh maps, which are a graphical method for simplifying Boolean algebra expressions. It covers topics such as minterms, maxterms, drawing K-maps for variables, examples of K-map simplification, and incompletely specified Boolean functions.

Uploaded by

Danu Nim
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
0% found this document useful (0 votes)
89 views69 pages

Karnough Maps (K - Maps) & Tabular Method: Mrs. Chami Muthugamage B.Sc. (Hons) in MIS, MBA Consultant/ Lecturer NIBM

The document discusses Karnaugh maps, which are a graphical method for simplifying Boolean algebra expressions. It covers topics such as minterms, maxterms, drawing K-maps for variables, examples of K-map simplification, and incompletely specified Boolean functions.

Uploaded by

Danu Nim
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/ 69

Karnough Maps

(K - Maps) & Tabular


Method
Mrs. Chami Muthugamage
B.Sc.(Hons) in MIS, MBA
Consultant/ Lecturer NIBM
Minterm

⚫ Product of Each Input Variable


ഥ 𝐂 + 𝐀𝐁𝑪
Z= 𝑨𝑩𝑪 + 𝑨𝑩
Minterm

⚫ Product of Each Input Variable


ഥ 𝐂 + 𝐀𝐁𝑪
Z= 𝑨𝑩𝑪 + 𝑨𝑩
Minterm

⚫ Product of Each Input Variable


ഥ 𝐂 + 𝐀𝐁𝑪
Z= 𝑨𝑩𝑪 + 𝑨𝑩
Minterm

⚫ Product of Each Input Variable


ഥ 𝐂 + 𝐀𝐁𝑪
Z= 𝑨𝑩𝑪 + 𝑨𝑩

Minterm
Minterm

⚫ Product of Each Input Variable


ഥ 𝐂 + 𝐀𝐁𝑪
Z= 𝑨𝑩𝑪 + 𝑨𝑩

Sum of Product
SOP
Maxterm
⚫ Sum of each input value

ഥ)
𝒁 = (𝑨 + 𝑩 + 𝑪)(𝑨 + 𝑩 + 𝑪
Maxterm
⚫ Sum of each input value

ഥ)
𝒁 = (𝑨 + 𝑩 + 𝑪)(𝑨 + 𝑩 + 𝑪
Maxterm
⚫ Sum of each input value

ഥ)
𝒁 = (𝑨 + 𝑩 + 𝑪)(𝑨 + 𝑩 + 𝑪
Maxterm
⚫ Sum of each input value

ഥ)
𝒁 = (𝑨 + 𝑩 + 𝑪)(𝑨 + 𝑩 + 𝑪

Maxterm
Maxterm
⚫ Sum of each input value

ഥ)
𝒁 = (𝑨 + 𝑩 + 𝑪)(𝑨 + 𝑩 + 𝑪

Product Of Sum
POS
Karnough Maps
(K - Maps)
Karnough Maps (K - Maps)
⚫ A Boolean expression can be represented by
graphically using a K - map
K – Map for 2 variable
Expression

X
A
B 0 1

1
K – Map for 2 variable
Expression

X
A
B 0 1
0 2
0

1 3
1
K – Map for 2 variable
Expression

X
A A = 0 → 𝐴ҧ
B 0 1 A=1→A
0 2
0 ഥ𝑩
𝑨 ഥ ഥ
A𝑩

1 3
1 ഥ𝐁
𝑨 AB
ഥ 𝑩+ A𝑩
Example : z = 𝑨 ഥ

Z
A
B 0 1
0 2
0 ഥ𝑩
𝑨 ഥ ഥ
A𝑩

1 3
1 ഥ𝐁
𝑨 AB
Example : z = 𝑨ഥ 𝑩+ A𝑩

Z
A
B 0 1
0 2
0 0 1

1 3
1 1 0
K – Map for 3 variable Expression

AB
C 00 01 11 10

1
K – Map for 3 variable Expression

AB
C 00 01 11 10
0 2 6 4
0

1 3 7 5
1
K – Map for 3 variable Expression

AB
C 00 01 11 10
0 2 6 4
0 ഥ𝑩
𝑨 ഥ
ഥ𝑪 ഥ𝑩
𝑨 ഥ𝑪 ഥ
𝑨𝑩𝑪 ഥ
𝑨𝑩𝑪

1 3 7 5
1 ഥ𝑩
𝑨 ഥC ഥ 𝑩𝑪
𝑨 ABC ഥC
A𝑩
ഥ𝑩
Example:𝑨 ഥ C+ ABC
ഥ𝑩
Example: 𝑨 ഥ C+ ABC

AB
C 00 01 11 10
0 2 6 4
0

1 3 7 5
1
K – Map for 4 variable Expression

X
AB
CD
K – Map for 4 variable Expression
X
AB
CD
00 01 11 10

00

01

11

10
K – Map for 4 variable Expression

X
AB
CD
00 01 11 10
0 4 12 8
00

1 5 13 9
01

3 7 15 11
11

2 6 14 10
10
K – Map for 4 variable Expression
X
AB
CD
00 01 11 10
0
00 ഥ𝑩 ഥ𝑫
ഥ𝑪 ഥ
𝑨

01

11

10
ഥ𝑩
Example: 𝑨 ഥ 𝑪𝑫 + 𝐀𝑩
ഥ 𝑪𝑫
ഥ + ABCD
Questions
⚫ Draw K- Maps for the following SOP
expressions
⚫ ҧ 𝐶ҧ + ABC
𝑍 = 𝐴B
⚫ 𝑍 = 𝐴ҧ𝐵ത 𝐶ҧ 𝐷 ҧ 𝐷
ഥ + 𝐴𝐵𝐶 ഥ + 𝐴𝐵𝐶𝐷

Questions
⚫ Draw K- Maps for the following SOP
expressions
⚫ ҧ + 𝐴𝐵ത
Z = 𝐴𝐶
⚫ Z= B + 𝐴ҧ𝐵𝐶ത
⚫ Z = 𝐴ҧ𝐶ҧ 𝐷
ഥ + BC
⚫ Z = A + 𝐵ത 𝐶ҧ 𝐷

⚫ If you have 2 variables in 3 variable
expression, we have to mark 2 cells
⚫ If you have 1 variable mark 4 cells
⚫ 4 variable expression
⚫ 3→2
⚫ 2→4
⚫ 1→8
Simplification of Boolean Expressions
⚫ Sub Cube
⚫ A set of 2n adjacent cells is referred to as a sub
cube
⚫ Maximal Sub Cube
⚫ It is the largest possible sub cube for a cell
⚫ Minimal Map
⚫ Map with minimum number of maximal sub
cubes that cover all minterms of the given
expression
Example:
X=𝑨ഥ BC + A𝑩
ഥ C+ A𝑩
ഥ𝑪ഥ + ABC

AB
C 00 01 11 10

0 0 0 0 1

1 0 1 1 1

BC
Z

AB
C 00 01 11 10

0 0 0 0 1

1 0 1 1 1

BC ഥ
A𝑩
Simplify the following K- Maps
Question 1

AB
C 00 01 11 10

0 0 0 0 0

1 0 1 1 1
Question 2

AB
C 00 01 11 10

0 0 1 0 0

1 0 0 1 1
Question 3

AB
C 00 01 11 10

0 1 0 0 1

1 0 0 0 1
Question 4

AB
C 00 01 11 10

0 1 1 1 1

1 0 0 0 1
Question 5
X
AB
CD
00 01 11 10

00 1 0 0 1

01 0 1 1 1

11 0 1 1 1

10 1 0 0 1
Question 6
X
AB
CD
00 01 11 10

00 0 0 0 0

01 0 0 1 1

11 1 0 0 1

10 1 0 0 1
Question 7
X
AB
CD
00 01 11 10

00 0 0 0 0

01 0 0 1 1

11 1 1 1 1

10 1 1 1 1
To get the simplified POS
Expression
⚫ Draw the K map for X
⚫ ഥ (cover all 0’s)
Get the minimal map for the X
⚫ ഥ in SOP form
Get X
⚫ Complement both sides
Example

Y
ഥ𝑪
Y=A𝑩 ഥ BC + ABC
ഥ+𝑨

AB
C 00 01 11 10

0 0 0 0 1

1 0 1 1 0
Question 1

AB
C 00 01 11 10

0 1 1 0 0

1 1 1 1 0
Question 2
X
AB
CD
00 01 11 10

00 0 0 0 0

01 0 1 1 0

11 1 1 0 1

10 1 1 1 1
ABC XYZ
⚫ Simplify X, Y, 000 100
Z given by 001 100
the following 010 011
truth table
011 011
using K -
Maps 100 001
101 111
110 110
111 101
EXAMPLE 1
⚫ Z = ∑ m (1, 3, 6, 7)
Z is a function of A, B, C
Question 1
⚫ Z = ∑ m (3, 9, 11, 13, 15)
Z is a function of A, B, C, D
Incompletely specified Boolean
Functions (Don’t cares)
A B C Y

0 0 0 1

0 0 1 0

0 1 0 1

0 1 1 0

1 0 0 X
Don’t care
1 0 1 X

1 1 0 0

1 1 1 1
Incompletely specified Boolean
Functions (Don’t cares)

⚫ The value of the function at “don’t care”


condition, is either or not significant or those
A, B, C values will never occur. Therefore
don’t cares can be either included or
excluded in a maximal sub cube so as to get
the minimal map
Z

AB
C 00 01 11 10

0 1 1 0 x

1 0 0 1 x
ഥ𝑪
Z=𝑨 ഥ + AC

AB
C 00 01 11 10

0 1 1 0 x

1 0 0 1 x
Z Excluded from
Maximal sub cube

AB
C 00 01 11 10

0 1 1 0 x

1 0 0 1 x
Z Included from
Maximal sub cube

AB
C 00 01 11 10

0 1 1 0 x

1 0 0 1 x
Question 1

AB
C 00 01 11 10

0 x 0 1 0

1 1 1 x 0
Question 2
X
AB
CD
00 01 11 10

00 0 0 0 1

01 0 x 1 1

11 0 1 x 0

10 x 0 0 0
Question 3
X
AB
CD
00 01 11 10

00 1 0 0 x

01 1 x 0 0

11 X 0 1 x

10 1 0 0 1
Get the simplified POS expression
X
AB
CD
00 01 11 10

00 0 1 X 0

01 0 1 X 0

11 0 0 X 0

10 1 1 X 1
Question 1
Z= f (A, B, C, D)

⚫ Z=1 for the minterms 3, 6, 8,12,13 and 14


⚫ Z= Don’t care for the minterms 2, 7 and 9
⚫ Z = 0 for the remaining minterms

Simplify Z using K map method


Question 2
Z = f (A, B, C, D)

⚫ Z =1 for the minterms (7,8,9,10,14,15)


⚫ Z= don’t care for the minterms (6,12)
⚫ Z = 0 for the remaining minterms.

Simplify Z using K map method


Question 3
Z = f (A, B, C, D)

⚫ Z =1 for the minterms (4,6,8,11,13,15)


⚫ Z= don’t care for the minterms (9,10)
⚫ Z = 0 for the remaining minterms.

Simplify Z using K map method


Question 4
Z = f (A, B, C, D)

⚫ Z =1 for the minterms (0,2,5,8,12,14)


⚫ Z= don’t care for the minterms (11,15)
⚫ Z = 0 for the remaining minterms.

Simplify Z using K map method


K – Map for 2 variable POS
Expression

X
A
B 0 1
0 2
0 A+B ഥ+B
𝑨

1 3
1 ഥ
A+𝑩 ഥ+𝑩
𝑨 ഥ
ഥ + B)(A + B)
Z = (𝑨

X
A
B 0 1
0 2
0 0 0

1 3
1 1 1
Minterms and Maxterms
Y = ∑ m (3, 4) Y = π M(3, 4)
 Minterm → 𝑨ഥ BC – 3  Maxterm → A + 𝑩 ഥ
ഥ +𝑪
ഥ+B+C
 Maxterm → 𝑨
 Minterm ഥ 𝑐ҧ – 4
→ A𝑩

Note: Maxterm
If the value of variable is zero write the variable as it is
If the value of the variable is logic one complement it and
write
EXAMPLE 1

ഥ +C)(𝑨
Y = (A+B+C)(A + 𝑩 ഥ)
ഥ + B+ 𝑪
EXAMPLE 2
⚫Z = π M (0, 3, 5)
Z is a function of A, B, C
Question 2
⚫Z = π M (0, 2, 8,13, 15)
Z is a function of P, Q, R, S

You might also like