Digital Logic Design - CS302 Power Point Slides Lecture 11

Digital Logic & Design
Dr. Waseem Ikram
Lecture 11
Recap
 Karnaugh Maps
 Mapping Standard SOP expressions
 Mapping Non-Standard SOP expressions
 Simplification of K-maps
 Don’t care states
Mapping a Standard POS expression
 Selecting n-variable K-map

 0 marked in cell for each maxterm
 Remaining cells marked with 1
Mapping of Standard POS
expression
 POS expression
( A  B  C).( A  B  C).( A  B  C).( A  B  C)
AB\C 0 1
00 1 0
A\BC 00 01 11 10
01 0 1
11 1 0 0 1 0 1 0
10 1 0 1 1 0 0 1
Simplification of POS expressions
using K-map
 Mapping of expression
 Forming of Groups of 0s
 Each group represents sum term
 3-variable K-map
 1 cell group yields a 3 variable sum term
 8 cell group yields a value of 0 for function

Simplification of POS expressions using
K-map3
 4-variable K-map
 16 cell group yields a value of 0 for
function
using K-map
(B  C).( A  B  C)
AB\C 0 1
00 0 1 A\BC 00 01 11 10
01 1 0 0 0 1 1 1
1 1 0 0 0
11 1 1
10 0 1 ( A  B  C).( A  C).( A  B)
using K-map
( A  B).(B  C)
AB\C 0 1
00 0 0 A\BC 00 01 11 10
01 1 1 0 0 0 1 1
1 1 1 1 0
11 1 1
10 0 1 ( A  B).( A  B  C)
using K-map
( A  B  C).( A  C  D).(B  C  D)
AB\CD 00 01 11 10
00 0 1 1 0
01 0 0 1 1
11 1 1 1 1
10 1 1 1 0
using K-map
( A  C).(C  D).(B  C  D)
AB\CD 00 01 11 10
00 0 0 1 0
01 0 0 1 1
11 1 0 1 1
10 1 0 1 0
using K-map
( A  B  C).( A  B  D).(B  C  D).( A  B  C  D)
AB\CD 00 01 11 10
00 1 0 1 1
01 0 0 0 1
11 1 1 1 0
10 1 0 1 1
Conversion between SOP & POS using
K-map
 Groups of 1s represents SOP expression
 Groups of 0s represents POS expression
Conversion between SOP & POS
using K-map
BD  BC  ABC  ABD  ACD
AB\CD 00 01 11 10
00 1 0 1 1
01 0 0 0 1
11 1 1 1 0
10 1 0 1 1
5-Variable K-map
 Represented as two, 4 variable K-map

5-Varaible K-map
A0
BC\DE 00 01 11 10
00 0 1 3 2
01 4 5 7 6
11 12 13 15 14
10 8 9 11 10
5-Varaible K-map
A 1
BC\DE 00 01 11 10
00 16 17 19 18
01 20 21 23 22
11 28 29 31 30
10 24 25 27 26
Simplification of a
5-Variable K-map
 5 variable K-map mapping
 5 variable K-map grouping
 5 variable K-map simplification
5-Varaible K-map simplification
A0
BC\DE 00 01 11 10
00 0 1 0 1
01 0 1 0 0
11 0 0 0 1
10 0 0 1 1
5-Varaible K-map simplification
A 1
BC\DE 00 01 11 10
00 1 1 0 0
01 1 1 0 0
11 0 0 0 1
10 0 1 1 1
Functions having multiple outputs
 Ckt receives a BCD number input
 Displays decimal number 0 to 9 on a
single digit 7-segment display
 Ckt receives two 2-bit numbers A and B
 Sets one of three outputs to >, =, or <
7-Segment Display
a
f b
e c
d
Function Table for Segment ‘a’
Inputs Output Inputs Output

A B C D a A B C D a
0 0 0 0 1 1 0 0 0 1
0 0 0 1 0 1 0 0 1 1
0 0 1 0 1 1 0 1 0 X
0 0 1 1 1 1 0 1 1 X
0 1 0 0 0 1 1 0 0 X
0 1 0 1 1 1 1 0 1 X
0 1 1 0 1 1 1 1 0 X
0 1 1 1 1 1 1 1 1 X
Function Table for Segment ‘b’

A B C D b A B C D b
0 0 0 0 1 1 0 0 0 1
0 0 0 1 1 1 0 0 1 1
0 0 1 0 1 1 0 1 0 X
0 0 1 1 1 1 0 1 1 X
0 1 0 0 1 1 1 0 0 X
0 1 0 1 0 1 1 0 1 X
0 1 1 0 0 1 1 1 0 X
0 1 1 1 1 1 1 1 1 X
Function Table for Segment ‘c’

A B C D c A B C D c
0 0 0 0 1 1 0 0 0 1
0 0 0 1 1 1 0 0 1 1
0 0 1 0 0 1 0 1 0 X
0 0 1 1 1 1 0 1 1 X
0 1 0 0 1 1 1 0 0 X
0 1 0 1 1 1 1 0 1 X
0 1 1 0 1 1 1 1 0 X
0 1 1 1 1 1 1 1 1 X
Function Table for Segment ‘d’

A B C D d A B C D d
0 0 0 0 1 1 0 0 0 1
0 0 0 1 0 1 0 0 1 1
0 0 1 0 1 1 0 1 0 X
0 0 1 1 1 1 0 1 1 X
0 1 0 0 0 1 1 0 0 X
0 1 0 1 1 1 1 0 1 X
0 1 1 0 1 1 1 1 0 X
0 1 1 1 0 1 1 1 1 X
Function Table for Segment ‘e’

A B C D e A B C D e
0 0 0 0 1 1 0 0 0 1
0 0 0 1 0 1 0 0 1 0
0 0 1 0 1 1 0 1 0 X
0 0 1 1 0 1 0 1 1 X
0 1 0 0 0 1 1 0 0 X
0 1 0 1 0 1 1 0 1 X
0 1 1 0 1 1 1 1 0 X
0 1 1 1 0 1 1 1 1 X
Function Table for Segment ‘f’

A B C D f A B C D f
0 0 0 0 1 1 0 0 0 1
0 0 0 1 0 1 0 0 1 1
0 0 1 0 0 1 0 1 0 X
0 0 1 1 0 1 0 1 1 X
0 1 0 0 1 1 1 0 0 X
0 1 0 1 1 1 1 0 1 X
0 1 1 0 1 1 1 1 0 X
0 1 1 1 0 1 1 1 1 X
Function Table for Segment ‘g’

A B C D g A B C D g
0 0 0 0 0 1 0 0 0 1
0 0 0 1 0 1 0 0 1 1
0 0 1 0 1 1 0 1 0 X
0 0 1 1 1 1 0 1 1 X
0 1 0 0 1 1 1 0 0 X
0 1 0 1 1 1 1 0 1 X
0 1 1 0 1 1 1 1 0 X
0 1 1 1 0 1 1 1 1 X
Karnaugh Map for Segment ‘a’
A  C  BD  BD
AB\CD 00 01 11 10
00 1 0 1 1
01 0 1 1 1
11 x x x x
10 1 1 x x
Karnaugh Map for Segment ‘b’
B  CD  CD
AB\CD 00 01 11 10
00 1 1 1 1
01 1 0 1 0
11 x x x x
10 1 1 x x
Karnaugh Map for Segment ‘c’
CDB
AB\CD 00 01 11 10
00 1 1 1 0
01 1 1 1 1
11 x x x x
10 1 1 x x
Karnaugh Map for Segment ‘d’
A  BD  BC  CD  BCD
AB\CD 00 01 11 10
00 1 0 1 1
01 0 1 0 1
11 x x x x
10 1 1 x x
Karnaugh Map for Segment ‘e’
BD  CD
AB\CD 00 01 11 10
00 1 0 0 1
01 0 0 0 1
11 x x x x
10 1 0 x x
Karnaugh Map for Segment ‘f’
B  CD  BC  BD
AB\CD 00 01 11 10
00 1 0 0 0
01 1 1 0 1
11 x x x x
10 1 1 x x
Karnaugh Map for Segment ‘g’
A  BC  CD  BC
AB\CD 00 01 11 10
00 0 0 1 1
01 1 1 0 1
11 x x x x
10 1 1 x x
7-Segment Circuit
7-segment
output
4-bit a
BCD
Logic
Circuit f b
input g
e c
d

Digital Logic Design - CS302 Power Point Slides Lecture 11

Uploaded by

Digital Logic Design - CS302 Power Point Slides Lecture 11

Uploaded by

Digital Logic & Design

Dr. Waseem Ikram

 Selecting n-variable K-map

 2 cell group yields a 2 variable sum term

 4 cell group yields a 1 variable sum term

 8 cell group yields a value of 0 for function

 2 cell group yields a 3 variable sum term

 4 cell group yields a 2 variable sum term

 8 cell group yields a 1 variable sum term

 16 cell group yields a value of 0 for

( A  B  C).( A  B  D).(B  C  D).( A  B  C  D)

BD  BC  ABC  ABD  ACD

 Represented as two, 4 variable K-map

Inputs Output Inputs Output

Inputs Output Inputs Output

Inputs Output Inputs Output

Inputs Output Inputs Output

Inputs Output Inputs Output

Inputs Output Inputs Output

Inputs Output Inputs Output

You might also like