2020-07-13

THROUGHOUT THESE SLIDES:

C SC 355 The symbols F, F1, F2, F3, . . .
designate example Boolean
Summer 2020 expressions

LillAnne Jackson

Karnaugh 4 variable, Multiple output, Lab 1

CSC 355 Summer 2020 Jackson

Today:
• variable Karnaugh maps

• Don’t Care States

• System with Multiple Outputs

CSC 355 Summer 2020 Jackson

1
 2020-07-13

3-variable Karnaugh Maps

mi A B C

m0 0 0 0 A’ B’ C’ a
B
m1 0 0 1 A’ B’ C b BC
A 00 01 11 10
m2 0 1 0 A’ B C’ c
0 a b d c
m3 0 1 1 A’ B C d

m4 1 0 0 A B’ C’ e A 1 e f h g

m5 1 0 1 A B’ C f
C
m6 1 1 0 A B C’ g

m7 1 1 1 ABC h

CSC 355 Summer 2020 Jackson

3 Variable Example
𝐹1 = 𝑀𝑁 ′ 𝑃′ + 𝑃′(𝑁 ≡ 𝑀)

NP
00 01 11 10
M
0 1
0 1 3 2

1 1 16
4 5 7

Technique:
- Combine bits into 'regular' groups
of size 1, 2, 4, or 8.
- Note the variables that are
unchanged in each group.

CSC 355 Summer 2020 Jackson

2
 2020-07-13

4 Variable Maps
C
CD
AB 00 01 11 10

00 m0 m1 m3 m2

01 m4 m5 m7 m6
B
11 m12 m13 m15 m14
A
10 m8 m9 m11 m10

D
CSC 355 Summer 2020 Jackson

4 variable Example

𝐹2 = 𝐴𝐶 𝐵 + 𝐷 + 𝐶𝐵𝐷 + 𝐴𝐵 𝐶 ≡ 𝐷

AB\CD
00 01 11 10

00

01

11

10

CSC 355 Summer 2020 Jackson

3
 2020-07-13

Another 4 variable Example

Find Minimal SOP:
𝐹3 𝑊, 𝑋, 𝑌, 𝑍 = 𝑚 0,2,3,5,6,8,11,13,14 + 𝑑 1,9,10

WX\YZ
00 01 11 10

00

01

11

10

CSC 355 Summer 2020 Jackson

Another 4 variable Example

Find Minimal POS:
𝐹3 𝑊, 𝑋, 𝑌, 𝑍 = 𝑚 0,2,3,5,6,8,11,13,14 + 𝑑 1,9,10

WX\YZ
00 01 11 10

00

01

11

10

CSC 355 Summer 2020 Jackson

4
 2020-07-13

Wait!

You all need a break from this to review Lab 1 and

compare it to these examples!

CSC 355 Summer 2020 Jackson

Systems with Multiple Outputs

w 𝐹1

x 𝐹2
y
z

Multiple Output Example #1:

• 𝐹1 𝑤, 𝑥, 𝑦, 𝑧 = 𝑚 0,1,3,4,5,7,12,13 + 𝑑 8,9,11
• 𝐹2 = 𝑤𝑦𝑧 + 𝑥 𝑦 + 𝑤𝑧 + 𝑦𝑧 + 𝑤𝑥𝑦 + 𝑥 𝑧

CSC 355 Summer 2020 Jackson

5
 2020-07-13

Multiple Output Example #1:

• 𝐹1 𝑤, 𝑥, 𝑦, 𝑧 = 𝑚 0,1,3,4,5,7,12,13 + 𝑑 8,9,11
• 𝐹2 = 𝑤𝑦𝑧 + 𝑥 𝑦 + 𝑤𝑧 + 𝑦𝑧 + 𝑤𝑥𝑦 + 𝑥 𝑧
WX\YZ WX\YZ
00 01 11 10
00 01 11 10
00
00

01
01

11
11

10
10

w 𝐹1

x 𝐹2
y
z
CSC 355 Summer 2020 Jackson

CSC 355 Summer 2020 Jackson

6
 2020-07-13

Mulitple Output Example #2: code words

Design a circuit that converts a 3- Binary code

bit binary word into a 2-bit code, as CBA YZ
shown at the right. 000 00
For each output, find: 001 10
1. the minimal sum-of-products
(SOP) expressions 010 11
2. a circuit that requires the total 011 00
minimal number of NAND gates
100 10
3. the minimal product-of-sums
(POS) expressions 101 11
4. a circuit that requires the total 110 10
minimal number of NOR gates
111 10

BA BA BA
00 01 11 10 00 01 11 10 00 01 11 10
C C
0 0 0
1 1 1
X Y Z CSC 355 Summer 2020 Jackson

Multiple Output Example #2: Y output

BA
00 01 11 10 Binary code
C CBA YZ
0 1 1
000 00
1 1 1
1 1
001 10
010 11
011 00
100 10
Y = 𝑩𝑨 + 𝑩𝑨 + 𝑪𝑩 101 11
110 10
= 𝑩 𝑨 + 𝑪 + 𝑩𝑨 111 00

Y
Y
CSC 355 Summer 2020 Jackson

7
 2020-07-13

Multiple Output Example #2: Z output

BA
00 01 11 10
C
0 1 1
1 1
1
Binary code
CBA YZ
000 00
001 11
Z = 𝐀𝑩 + 𝑨𝑪 010 10
011 01
100 10
101 11
Z 110 10
111 10
CSC 355 Summer 2020 Jackson

Working with 4-variables: Some examples

YZ
WX 00 01 11 10
00
F1 = 𝑿𝒀𝒁 + 𝑾𝑿 + 𝑾𝑿𝒀𝒁 + 𝑾𝑿𝒀 𝒁
01
11
11
F2 = Y𝒁 + 𝑾𝑿𝒁𝒀 + 𝑾𝑿𝒀 + 𝑾𝒀 𝑿 𝒁 10 1
1
1
11
1
1 1
1
F3 = 𝑾𝒁 + 𝒀 + 𝒁 𝒀 + 𝒀𝒁𝑿

CSC 355 Summer 2020 Jackson

8
 2020-07-13

An Example with BCD Inputs:

Incompletely specified A B C D P Q R S
functions: 0 0 0 0 0 0 0 1
0 0 0 1 0 0 1 0
Don’t Care States 0 0 1 0 0 0 1 1
0 0 1 1 0 1 0 0
0 1 0 0 0 1 0 1
0 1 0 1 0 1 1 0
0 1 1 0 0 1 1 1
For a given function, not all outputs
are necessarily defined. 0 1 1 1 1 0 0 0
1 0 0 0 1 0 0 1
Example: Binary Coded Decimal (BCD)
1 0 0 1 0 0 0 0
Representation of a digit.
 Some input patterns are never seen, 1 0 1 0 X X X X
 the associated outputs are Don’t 1 0 1 1 X X X X
Cares
1 1 0 0 X X X X
1 1 0 1 X X X X
1 1 1 0 X X X X
CSC 355 Summer 2020 Jackson 1 1 1 1 X X X X

A B C D P Q R S
Don’t cares 0 0 0 0 0 0 0 1
To specify output function P:
On-set 0 0 0 1 0 0 1 0
Off-set
0111 0000 0 0 1 0 0 0 1 1
1000 0001 0 0 1 1 0 1 0 0
0 0 1 0 0 1 0 0 0 1 0 1
0 0 1 1 0 1 0 1 0 1 1 0
0 1 0 0 0 1 1 0 0 1 1 1
0 1 0 1
0 1 1 1 1 0 0 0
0 1 1 0
1 0 0 1 1 0 0 0 1 0 0 1
1 0 0 1 0 0 0 0
But often abbreviated to: 1 0 1 0 X X X X
On-set 1 0 1 1 X X X X
Off-set
0111 00XX 1 1 0 0 X X X X
1000 010X 1 1 0 1 X X X X
01X0 1 1 1 0 X X X X
1001 1 1 1 1 X X X X
CSC 355 Summer 2020 Jackson

9
 2020-07-13

Don’t Cares: example for P

CD
00 01 11 10 P often abbreviate
AB
0 On-set Off
00 0 0 0
0111 00
01 0 0 1 0 1000 01
01
11 X X X X 10

10 1 0 X X

P  A, B , C , D    m  7, 8 
  d 10,11,12,13,14,15 
 BCD  AD
CSC 355 Summer 2020 Jackson

Don’t Cares: example for Q

CD
00 01 11 10 P often abbreviate
AB
1 On-set Off
00 0 0 0
0111 00
01 1 1 0 1 1000 01
01
11 X X X X 10

10 0 0 X X

Q(A,B,C,D) =
𝒎 𝟑, 𝟒, 𝟓, 𝟔 + 𝒅 𝟏𝟎, 𝟏𝟏, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒, 𝟏𝟓

= 𝑩𝑪 + 𝑩𝑫 + 𝑩𝑪𝑫

CSC 355 Summer 2020 Jackson

10
 2020-07-13

Don’t Cares: example for R

CD
00 01 11 10 P often abbreviate
AB
0 On-set Off
00 0 1 1
0111 00
01 0 1 0 1 1000 01
01
11 X X X X 10

10 0 0 X X

R(A,B,C,D) =
𝒎 𝟏, 𝟐, 𝟒, 𝟓 + 𝒅 𝟏𝟎, 𝟏𝟏, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒, 𝟏𝟓

= 𝑨 𝑪𝑫 + 𝑨𝑪𝑫

CSC 355 Summer 2020 Jackson

Don’t Cares: example for S

CD
00 01 11 10 P often abbreviate
AB
0 On-set Off
00 1 0 1
0111 00
01 1 0 0 1 1000 01
01
11 X X X X 10

10 1 0 X X

S(A,B,C,D) =
𝒎 𝟎, 𝟐, 𝟒, 𝟔, 𝟕 + 𝒅 𝟏𝟎, 𝟏𝟏, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒, 𝟏𝟓

= 𝑪 𝑫 + 𝑪𝑫

CSC 355 Summer 2020 Jackson

11
 2020-07-13

More Examples that use Don’t Cares:

F W , X , Y , Z   m  0,2,5,6, 8,10,15 
  d  3, 4,7, 9,14 

YZ
WX 00 01 11 10
1 X 1
00
1 1
01 X X

11 1 X 1

10 1 X

CSC 355 Summer 2020 Jackson

A Don’t Care Trick Example:

YZ YZ
WX 00 01 11 10 WX 00 01 11 10
1 X 1 1 X 1
00 00
1 1 1 1
01 X X 01 X X

11 1 X 1 11 1 X 1

10 1 X 10 1 X

F  YZ  XY  XY  W X Z F  WX  XY  XZ  W X Z

Are These Equivalent?

CSC 355 Summer 2020 Jackson

12
 2020-07-13

Another Don’t Care example:

WX
YZ 00 01 11 10
1 X 1
00
1 X
01

11 X X 1

10 1 1 X 1

CSC 355 Summer 2020 Jackson

Another Don’t Care example:

WX
YZ 00 01 11 10
1 X 1
00
1 X
01
F  XY  X Z  W X
11 X X 1

10 1 1 X 1

CSC 355 Summer 2020 Jackson

13
 2020-07-13

Products of Sums (POS) – grouping the 0s

YZ
WX 00 01 11 10
0 1 1 0
00
1 1 1 0
01
11 1 0 0 0

10 0 0 0 1

F W , X , Y , Z    m 1,3, 4,5,7,10,12 

𝑭= 𝑾 𝑿 𝒀 + 𝑾𝒁 + 𝑾 𝒀𝒁 + 𝑿 𝒀𝒁

CSC 355 Summer 2020 Jackson

14