‫محاضرة بمادة التقنيات الرقمية‬

‫م‪ .‬د حسين فالح مهدي‬

‫جامعة ديالى‬
‫كلية الهندسة –قسم هندسة الحاسوب‬
‫‪2022-2023‬‬

‫‪Karnaugh map -3‬‬

 Normal Term
2

A normal term is a product or sum term in which no

variable appears more than once.

Examples of non-normal terms:

 W．X．X．
 W + W + X’ + Y

Examples of normal terms:

 W
 W+
 Minterm
3

An n-variable minterm is a normal product term with n

literals.

Examples (4-variable minterms):

 WZ
W
 Maxterm
4

An n-variable maxterm is a normal sum term with n

literals.

Examples (4-variable maxterms):

 + + Y+ Z
 W + + Y’ + Z
Minterms and Maxterms
5
Determining Standard Expression from
a Truth Table (example)
I/P O/P  There are four 1s  There are four 0s in
A B C X

SOP POS
in the output and the output and the
0 0 0 0 the corresponding corresponding
0 0 1 0 binary value are binary value are
0 1 0 0 011, 100, 110, and 000, 001, 010, and
0 1 1 1 111. 101.
011  A BC 000  A  B  C
1 0 0 1 100  AB C 001  A  B  C
1 0 1 0 110  ABC 010  A  B  C
1 1 0 1 111  ABC 101  A  B  C
1 1 1 1
X  A BC  AB C  ABC  ABC

X  ( A  B  C )( A  B  C )( A  B  C )( A  B  C )
 Converting POS Expressions to Truth
Table Format (example)
Develop a truth table Inputs Output Product
for the standard SOP A B C X Term
expression ( A  B  C)
0 0 0 0
( A  B  C )( A  B  C )( A  B  C ) 0 0 1 1
( A  B  C )( A  B  C ) 0 1 0 0 ( A  B  C)
0 1 1 0 (A  B  C )
1 0 0 1
1 0 1 0 (A  B  C )
1 1 0 0
( A  B  C)
1 1 1 1
 Mapping a Standard POS Expression
(full example)
The expression:
C
0 1
( A  B  C )( A  B  C )( A  B  C )( A  B  C )
AB
000 010 110 101
00
0
01
0
11 0
10
0
 K-map Simplification of POS
Expression
( A  B  C )( A  B  C )( A  B  C )( A  B  C )( A  B  C )

C
0 1
AB A

00 0 0 Y ( A, B, C )  A.( B  C )

01
0 0
11
0 1
B C
10 1 1
 2

3
 Don’t-care Conditions
 In certain problems, some outputs are No.
0
A
0
B
0
C
0
D
0
P
1
not specified. 1 0 0 0 1 0
2 0 0 1 0 0
 These outputs can be either ‘1’ or ‘0’. 3
4
0
0
0
1
1
0
1
0
1
0
 They are called don’t-care conditions, 5
6
0
0
1
1
0
1
1
0
1
1
denoted by X (or sometimes, d). 7 0 1 1 1 0
8 1 0 0 0 0
 Example: An odd parity generator for 9
10
1
1
0
0
0
1
1
0
1
X
BCD code which has 6 unused 11 1 0 1 1 X
combinations. 12
13
1
1
1
1
0
0
0
1
X
X
14 1 1 1 0 X
15 1 1 1 1 X
 “Don’t Care” Conditions
INPUTS O/P CD
A B C D Y 00 01 11 10
0 0 0 0 0
AB
0 0 0 1 0
0 0 1 0 0 00
0 0 1 1 0
0 1 0 0 0
01 1
0
0
1
1
0
1
1
0
0
0
11 x x x x
0
1
1
0
1
0
1
0
1
1
10 1 1 x x
1 0 0 1 1
1 0 1 0 X
Without “don’t care”
Y  AB C  A BCD
1 0 1 1 X
1 1 0 0 X
1 1 0 1 X With “don’t care”
Y  A  BCD
1 1 1 0 X
1 1 1 1 X
2 5

4
1

3 6