Introduction to

Electrical and Computer Engineering

Lecture 5
Source: M. -C. Brunet (UIUC) (email: brunet@illinois.edu)
https://engineering.illinois.edu/directory/profile/brunet

Handout 11
Digital Circuits

2
 527 = 5x102 + 2x101 + 7x100
 52710 = 5x100 + 2x10 + 7x1
725 = 7x102 + 2x101 + 5x100
 72510 = 7x100 + 2x10 + 5x1

13 = 8 + 4 + 1
 1310 = 11012 (4 bits)

4
Ref. M. -C. Brunet 3
 0

33

63

Ans. 5 bits
Ref. M. -C. Brunet 4
 0000 0 1000 8
0001 1 1001 9
0010 2 1010 A
0011 3 1011 B
0100 4 1100 C
0101 5 1101 D
0110 6 1110 E
0111 7 1111 F

𝟐𝑪 𝟏𝟔 = 𝟎𝟎𝟏𝟎𝟏𝟏𝟎𝟎 𝟐 = 𝟒𝟒𝟏𝟎

𝟐𝑪 𝟏𝟔 = 𝟐. 𝟏𝟔𝟏 + 𝟏𝟐. 𝟏𝟔𝟎 = 𝟒𝟒𝟏𝟎

Ref. M. -C. Brunet 5
 0 0 1 0 1 0 1 1 Ans. 𝟐𝐁 𝟏𝟔

8 bits = 23 bits
210
220
230

4GB = 22 x 230 x 23 bits = 235 bits

Ref. M. -C. Brunet 6
Ref. M. -C. Brunet 7
Ref. M. -C. Brunet 8
 𝑿 or 𝑿′ complement
𝑿 ∙ 𝒀 or 𝑿𝒀 product term

𝑿+𝒀 sum term

𝑿⊕𝒀

Ref. M. -C. Brunet 9

 𝑿 3-level
𝑿∙𝒀

𝑿∙𝒀+𝒁 Sum of Product (SOP)

= 𝑿 ∙ 𝒀 + 𝒁 Priority

Ref. M. -C. Brunet 10

 𝑭 𝑿, 𝒀, 𝒁 = 𝑿 ∙ 𝒀 + 𝒁
0
1
1
1
0
1
0
1
𝑭 𝟎, 𝟎, 𝟎 = 𝟎 ⋅ 𝟎 + 𝟎
=𝟏⋅𝟎+𝟎
The last resort.
=𝟎+𝟎
=𝟎
 Do 𝑿 ⋅ 𝒀 first.

𝑭 = 𝟏? ⟺ 𝑿 ∙ 𝒀 = 𝟏
Ref. M. -C. Brunet
𝒁=𝟏 11
 𝒀 + 𝑿𝒀 𝑿𝒀

𝑮=𝟏⟺ 𝒀=𝟏 𝑯=𝟏⟺ 𝑿=𝟏

𝑿𝒀 = 𝟏 𝒀=𝟏

1 𝑮=𝑯 0
0 1
1 or 𝑯 = 𝑮 0
1 0

Ref. M. -C. Brunet 12

 𝑮 𝑿, 𝒀 = 𝒀 + 𝑿𝒀

0 0 1 0

1 0 0 0

0 1 1 1
Ref. M. -C. Brunet 13
 𝑿𝒀𝒁 + 𝑿𝒀𝒁

𝑿𝒀𝒁 + 𝒀

0 0 0 0
1 0 1 1
0 1 0 1
0 1 0 1
Ref. M. -C. Brunet 14
 𝑲 = 𝟏?

𝑿𝒀𝒁 + 𝑿𝒀𝒁

𝑳 = 𝟏?

𝑿𝒀𝒁 + 𝑿𝒀𝒁 + 𝑿𝒀𝒁

Ref. M. -C. Brunet 15
 𝑿𝒀𝒁, 𝑿𝒀, etc.





𝑿𝒀, 𝑿𝒀, 𝑿𝒀, 𝑿𝒀
Ref. M. -C. Brunet 00, 01, 10, 11 16
 No No
Yes No
Yes Yes

Ref. M. -C. Brunet 17

 5 1s in table ⟹ 5 minterms

𝑿𝒀𝒁 + 𝑿𝒀𝒁 + 𝑿𝒀𝒁 + 𝑿𝒀𝒁 + 𝑿𝒀𝒁

Better?
Ref. M. -C. Brunet 18
 1 1 1
0 1

𝑿
1 0
0 1

0 1
𝑿𝒀 0 1
0 1
1 0

𝑿+𝒀 1 1 1
1 0 1
0 1 1
0 0 0
Ref. M. -C. Brunet 19
20
 𝑿𝒀 𝒁 + 𝒁 + 𝑿𝒀𝒁 distributive

𝑿𝒀 ∙ 𝟏 + 𝑿𝒀𝒁 complementary

𝑿𝒀 + 𝑿𝒀𝒁 identity

Prove by Truth table?

Ref. M. -C. Brunet 21

 4 13 2
P (or Q) 3 8 2
R 3 7 2
Ref. M. -C. Brunet 22
 


𝑴 = 𝟏?
𝑴 = 𝑿 + 𝑿𝒀𝒁 = 𝑿 + 𝑿 𝑿 + 𝒀𝒁 = 𝑿 + 𝒀𝒁

(slide 15)
2 5 2 much better

Ref. M. -C. Brunet 23

 𝑿
𝒀 𝑿+𝒀
𝑿
𝒀 𝑿∙𝒀

0
0
0
1
0
0
1
0
𝑰 = 𝑿𝒀𝒁 + 𝑿𝒀𝒁

Ref. M. -C. Brunet 24

 𝑱 = 𝑿𝒀𝒁 + 𝑿𝒀𝒁

Ref. M. -C. Brunet 25

Ref. M. -C. Brunet 26
Ref. M. -C. Brunet 27
Ref. M. -C. Brunet 28
Ref. M. -C. Brunet 29
Source: M. -C. Brunet (UIUC) (email: brunet@illinois.edu)
https://engineering.illinois.edu/directory/profile/brunet

Handout 12
Combinational Circuits

30
Ref. M. -C. Brunet 31
Ref. M. -C. Brunet 32
 2
3
1310
2 10
1 1
0 0
3 11
Ref. M. -C. Brunet 33
 1 1 1 1
13
7
10100 20
Carry Sum

Ref. M. -C. Brunet 34

 2n n+1

Every bit position, we do the same.

FA ⋯ FA FA 0

Ref. M. -C. Brunet 35

 1

1+0+1
= 210 = 102 0
carry sum

1 0 1 1 0 1

1 1 0 0

0 0 1
Ref. M. -C. Brunet 36
 0 0
0 1
0 1
1 0
0 1
1 0 carry = 𝒂𝒃𝒄 + 𝒂𝒃𝒄 + 𝒂𝒃𝒄 + 𝒂𝒃𝒄
1 0
1 1 sum = 𝒂𝒃𝒄 + 𝒂𝒃𝒄 + 𝒂𝒃𝒄 + 𝒂𝒃𝒄
(Canonical SOPs)

Ref. M. -C. Brunet 37

 0 0 carry = 𝒂𝒃
0
0
1
1
sum = 𝒂𝒃 + 𝒂𝒃 = 𝒂⨁𝒃
1 0

Ref. M. -C. Brunet 38

 (1310) (710)

4 bits are not

1 enough to store
carry = 1 the sum.
There is overflow.
0 1 0 0

Ref. M. -C. Brunet 39

 1 (common cathode)
0 (common anode)
Ref. M. -C. Brunet 40
 GND

Ref. M. -C. Brunet 41

 blank

Assuming that a common cathode display is used

Ref. M. -C. Brunet 42

 0 0 0 0 0 0 0 blank
1 0 0 1 1 1 1
1 1 1 1 1 1 0
0 1 1 0 1 1 1
Ref. M. -C. Brunet 43
 W
X
Y
Z

424 combinations
WXYZ
W X Y Z
0 0 0 0 1 1 1 1 1 1 0
0 0 0 1 0 1 1 0 0 0 0
0 0 1 0 1 1 0 1 1 0 1
10 . . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
1 0 0 0 1 1 1 1 1 1 1
1 0 0 1 1 1 1 1 0 1 1
1 0 1 0 0 0 0 0 0 0 0
. . . . . . . . . . .
6 . . . . . . . . . . .
1 1 1 1 0 0 0 0 0 0 0
Ref. M. -C. Brunet 44
 adder

A=3 B=5
A+B=8

A=1 B=1
A+B=2
blank
A=5 B=7
Ref. M. -C. Brunet A + B = 12 45
Ref. M. -C. Brunet Lê Chí Thông 46