DIGITAL ELECTRONIC

Analog Signal Digital Signal

Ya Ya
HIGH HIGH

unfortu
a

Vol

L
2v-SV

Low
0 - . 8V

Su I I IS ev
T IT ST 4TST
mapping
nEIR > y EIR

Benefit of Digital System

· More immune to noise

·
Easy to store
· Fabrication easy

· scalable

Ya

unfortu
Me,
> ADC < 101101100 sposs

Digital
Su

Analog Analog

Binary Number
System

Prime
system system Reset the column
my
in seriment by 3190
1
by
in

i
000 0 > 0

3 O
00 I > 1
- L
O
i > 3
00 I

inout
crement
Reset to "zero
O
&
a 010
?
L
01 1 0 > 6
&
2011 37
10 o oh
> 8
10 0 1 > 9

10 1 0 > 10

>
101 11

11 o 0
12

110 > 13

1110 > 14
11 11 > 15

1000 0 > 16
 Decimal Number

Decimal Converter
to
Binary
(345) , = 3x10 + 4x10 + 5x10
0

↓ = 300 + 40 + 3 = 345 (27) =

(110 11) 2
,0

Reminder

Number 27
Binary 2

USB[heast Significant Bit] 2 13 1 a > LSD

>
-
IX + ox2 ++
&1010)
= 2 6 I

= 8 + 0 + 2 + 0
= 10 23 O
3210
most signifant 21 I

Bit ((((() = (x2 + 1x2 + |x2 + 1x28 8 I > MSB

=

= 8 + n + 2 + 1
= 15

(10000 (x2"+o x2" = + ox2 + ox2 + 0x2

(0 625)10 .
=
( . 101)
= 16

·
62sX2 = 1 .
25 0 > I MSB

(0) 0
(1) = 1x2 + 0x2 + 1x20 + 0x2" + 1x2"+ 1x2 3 -

X2 3 0 30
.
25 = .

-is
·

-
↓ dd ddd
So 1 00 21
3
· x2 = .

vLSB
210 -1 2 -
-

= 5 + /n + 18 = S + 2) + 123 = 5 . 375

(12 35)u =
(3033)y
(xu + 2xx + 3xx' + Sxx0 = 3xy + 0xy + 3xy + 3xy
393 + [u 8
"
u3 + zn + 3x sy + 3 =
y 6 ]
=> = =

# Addition
Binary

0 +
o = 0

0 + = 1

1 + 0 = 1

1 +1 = 0 with
Carey 1 (1) , 0
+ (110 =
(2) ,0 =
(10)
1 +1 H = 1 with
Caney 1 (110 + (1) , 0
+ (110 =
(3)10 =
(11) 2

I A

e I o 10 > (10) , 0
j
.

+ 1 110 > (4) 1 0

(24) ,
#
> o

⑪ subtraction weight 8 4 2 10 -> (2) ,0

2)
2x) =

=>
2-
borrow
0
0910
=
o 0 2
J
-

1 -
0 = 1 I + OX O > (14) ,0

1 -
1 = O T 00 I & < (3)10
0 -
17 1 with borrow I I O I I > (11)10

weight 8 weight 16 8 4 2
4 2

888thL Se
,

-
3 16

10 2
e
g.
.

J
sixee
.

to to o o > (12)10 of o t > (16)1 0

0 1 1 > (7)
T
O 1 1 1I > (IS) , 0
T
10

00 0 0 1
> (1)
O I O I
> (5) , 0
10
Is 82's Complement
used represent signed
to
binary number

· n-bit unsigned binary number >

-
(0,to (2-1) , 0

ey 46it : 0000 -
(11) -
(0), -
as

3
① Signed Binary Number

.
Two different representation of
& inves # bit = 3

83
/34934 %
to
impractical
oo
:
34:
+ o 10
%
-

-
34

signed binary
[-)to -
· n-bit number >
-

ey bbit :
(111 1117 >
-
-75

Is complement
Mbits--(20_)
+
weights 6432168421 to (20 -

1)
+ 34(86it) O OI 00 010
MSB ~
L SIS
sign bit
Let N = 4
H = 0001 +7 =
011/

7 1000
00100010 1 = 1/10 =
-
-

-
34(8bit) 1 1 O I 1 / 0 1 [is complement of + 35] +o = 0000 -0 = 111/

+ 34(86it) 00100010 [Is Complement of

-
34]

2's Complement Let N =

4

weights 6432168421 +7 =
0111
+ 34(86it) o 0 00 010 +3 = 0011
MSB L SIS
~
sign bit H = 0001

o
+
= 0000
b 111)
00100010 O = 000p

F
S
-

1101110]
is complement -
I = 111I

+1 11 I
-
3 - 0

-
34(8bit) 1101 1110 [2's complement of + 34] -

7 = 1001

0010 0 001 s = 100 0

y
-

0111
+ 1

81Such
+ 1

+ 34(86 it)00100010 [2's complement of -34] othe

 2's Complement Arithmetic
Edits
weight 8421 weight 84 21

possible to
10017 [Not represent
+ 9
+ 6 0 0 1 1 0 O
+ 9 + 7 = 16
+ 7
bits]
+ 7 0 0 1 1 /
O 01 11 3
using
+ 13 O 110 1 - 0 I 0000X(involid]

6 = 00110
weight IS 0 1 I 1 I
8421 weight 8421 =

11001 01 10000
+ 13 o 11 0 I -
IS 1 0 0

110
To G(11010 901001
+ 1
Es -

+ 1000 1

- 1010
+7 - 6

↓ it is -ire .
So we need to take Is complement
number
corry 00 1 I
0

+
1

00110 = 6

Hexadecimal Number weight 128643216 84 2 /

3
Decimol

O
Hex
Binary Decimo)

S
HeX
Binary (25) =
(
O 0000 8 100 0

I I o oo 1 9 9 100 = 19

2 2 0010 10 A 1018

3 3 0011 1( B 1011

440100 12 C 110 0

S 5 010 13 D 110
66 0110 14 E 1110

7 7 011I IS F 111
# Gate
Logic

ilp
olp
ilp Gate
·
ilp

AND GATE OR GATE NOT GATE

A A =
A 3 Y -
-
Y
NY
-
B

A BY A B Y A Y
O
0
% 00
O

OI I i !
I O O I O
I
I I I I I
I

Y = A . B Y = A +B

D
NAND GATE (Y =B) NOR GATE (y =B)

DoD D * *
D

A B X=A B . Y =T : FB A B X = A + By = Y AFD
=

O O I
O O O 01
O I 01 O I I O

10 I O

9
O

I I 6 I I " 8

A BC Y A = = A + D+ y
Y M Y = A + B+ (

o
o

o
0

1
O

O
9 = I

i
01 0 O

0 11 O I O

i
100 O
10

110
I O

O
i ·
I I I I O
 XOR Gate XNoR Gate

( +
=
AB A
X = AOBY B

!
O O

OI ↓ OI I

I I O I
o
O

I I 11 O I

Y = A5 + BA Y = AB = AB +B = A OB
= A B

B D C

A B C Y = Y
AQC =

o 0 O O

o 0 I

01
0 11
0

is
100 I

10 I O

110 I

I I I I
 Law of Boolean Algebra
A 1 .
= A A +1 = A

A .
0 = 0 A + A = A

A A .
= A A + = 1

A T .
= 0 A + B = B + A
A . B = . A
B (A + b)+ c =
A + (B + c)
( B).
.
C = A (B . .
C) A + BC = (A + B) (A + 1)
A (B+ C
.
= A B . + A .
L

ACAD)
ATAB
= A

A B .
= A + B + 5

Absorption Low

-A + AB = A
(B) = A
=
(

o A (A + B)
.
= A A
. + A D . = A + A B
.
=
A

LAB
#Morgan's = A + 5 + 5 A+B = A + 5

T AB
A 13 A +

!
O O I

01 I O O

I 00 10 I I

I I 00 I ⑧ O

A+ 5c =. = (B i)
g:
e .
.
+

NAND Gate as the Universal Gate

↑ Da Y= A OR Gate
Using
NAND Gate

Inventer

↑ Do =

AND Gate NAND Gate

Using

Di Do
A = A is
.
 Implementation of Boolean Function Using 2 ilp NAND GATE

2 = A5C = ACT

↑
C

13

A . B.

NOR GATE as Universol Gate

AND Gate

Nor
AFB

NOT Gate ↑
+ (XE
XNOR Y = AOB = AB +AB

Lit P =5 =B

AOB = ABtAs = AB + P = (P + A)(p + B)

Fo
A

AFB =. 5 =
P =
( + P)(B + P) = P + AB
 Boolean Function Representation product Som

- -
A
>
-
SOP : Sum of Product (A B)
.
+ (Asc) + (AB)
Logic
B -

c -
Circuit FL> POS : Product of Sum (AtD( (AtB+ c) (A + B
. ·

un
D
-

Sum Product

+A : Non-canonical Sopform [Each Product term doesn't contain all variables)

F = .
B + A B : .
Canonical Sop form [Each Product term contains all variables)

Represents
· Minterm "ones" Represents "zeros'
- a
A B C Fl Minterm Moxterm F
O 00 1 As Mo A + B +C Mo O Sminterm complement of

MoxteA
00 I O ABC my A + B+ 5m , I

01 0 1 ABJ Mr Atitc Me O - - B .
T
0 11 g #BC Ms A + 3 +5 My I

I 00 I ABC My AtB( My O

OI O A BS Ms AtBI Ms I
Y I o 0 A BE Mb A +B + C Mo I

I I I I ABC my Att My g

↑ = Bl + ABC + ABT +ABC [Canonical sos]

=
Mo Mc + Ma + My

= [(0 ,
2
,
4, 7)

F =C + ABL + ABC + ABE

= Al + ABC + Astab = .
Ab . .
TE

(A c) (A + - +2) (A + c) (A +3 + 1
↑ = + B+ . o
B+ .

=
Mi .
M2 Ms My
. .
=T (1 ,
3
,
5, 6)
Kamnaugh Map (K-Map)
Canonical Sop

F(A ,
B
.B + ABC

To implement we need 3 AND 8 LOR

= I

Gate
+

At
only 1 bit is
changing
- -
B400 Minterm
01
A
O
11 10

3 2
-
L'ABC BE

·
O As
2
AESABC
6
A

#, (A ,
B, c) =
[ (0 ,
1
, 5) #, (A ,
B, c) =
E (0 ,
1
,
3 ,
3)

ABS Euro Bot 11 10

O 13 2

13
O 2

O ↓ I I I

( 45
I
7 6 Y
I
S
7 6

!Ignore A
F =5 + B+ C

F =i + 5C

#, (A ,
B, c) = &(h ,
6) # (A ,
B, c) = &(1 ,
3 5
, , 7)

-
abo to 11 10 AB4oo ol 11 10

3
O
0132
I

Ci
O

Y S 6 Y S
7 6
7
I 11
I I

F = AT F = C
 & (4 5 6 7 9 13
13) AB + BC + AJD
F, (A B <
, D) 16, =
= , , , , , ,
, ,

-
"00 0111 10
as
2
O
I 3

00

4 S 76
I

jo
I I
↑

12 13 13 14
I I

1)
I

g 9 11 10
I
10

don't care condition

-
F
, (A ,
R <
, , D) = & (5 ,
6
,
9 13 ,
,
15) + d(1 ,
7, 14) = JD + BC

-
"00 0111 10
as
2
O 3

00 X
4 S 7 6
I X I

o 12

I
13
I
IS
X
14

g 9 11 10

10 I

F(A ,
B (
, , D) = E (5 ,
6
,
9 13 ,
,
15) + d(1 ,
7, 14)

Fz(A ,
B, ( , D) = ↑ (0 ,
2
, 3 h
, ,
8
,
10
, 1) d(17
.
, (4) = JJ + BC

-
"00 0111 10
as
30
O
I

00 O X O

F =) = ((+ x)(b + i)

(
+

45 7 6

OI O X

12 13 IS 14
be treated as
zelo and
11 O > This
- con
used
g 9 11 10
can be in
minimization
10 O O o
 ↑z (A ,
B, ( , D) = (0 ,
3, 7, 8 9 10,
, ,
11 , 15) . d(2 h),

'
00 01 11 10
Ai
2
O
I 3
X
O
F
00 O
= - + AB + 2D

4 S 7 6

01 X O
Ez = 55 + A5 + D

12 13
g
IS 14
= (b + D) . ( + 1) . (i + 5)
11
g 9 11 10

O O O
10 O

⑪ Sop : Non-canonical to Canonical Form

F(A ,
B
, c) =
AB + c = AB(c +E) + c(A +)(B + i)

= ABC + ABT + ARC + ABC + ABC + ABC

un un

E
+ABC
= ABC + ABE + ABC + ABC = (1 ,
3
,
5 6
, , 7)
in n en
un un

M7 M6 ma my

# y = A + 5C

A Bloo ol 11 10

O
O

P
13
O G Y = &(44 ,
5 , 6, 7)
O
= π(0 2 3 )

1A
45 ,
11 , ,

I I

C
Half Adder 8 Full Adder

A B S(Sum) carey)
A
Half S(Sum) O O O O

Add er o I I O
13 c(Carry)
10 I O

I I O I
S = B + AB = ADB
C =
AB to dea with this
No place
⑰
Limitation !

3
The

% )))S
= AOB
+
9 ! 6 it is not
carry
incorporated
O at the ; lp .
AB
Da
=

B Cin s(Som) Cont

A Full S(Sum)
o O O O

13 o O I I O
Add er
Cin Cout(Carry) O I O I O

d
01 I O

I O O I

I O I O

L I O O I

I I 7 I I

S = 5 Cin + Bin + ABin + ABCin

= A (i (in + B [in) + A (B [in + B(in)

=in) A
+

= AG BO Cin

Cort = B (in + ABCin + ABCin + ABCin =

&(3 ,
5
,
6
,
7)

Blin
A oo 01 11 10
O I 3 2

O I
Coot = AB + BC AC in
6
4 S 7
I I I
I

Cort = B (in + ABCintABCin + ABCin

=>
CinLABtAi) + AB([intCir) =
CinCAOB) + AB
 S = AD B (in

Cort =
AB + (in (ADB) = AB + BCin + ACin

> Half Adder

%.
I
8

Cin

=
Al + (in (AR)

D :

A B .

Cort, = AB AB + (in (ADB)

J
Cort =
A Half
Adder
B- S= AB
Half (ADB)
(in
Cort
=

Adder
Cin S = AD BO Cin

Ripple Carry Adder

4-bit Adder

I I 10 O I I O

By As Br Az Bl A, Bo Ao

vv V V
vv vv

1 C2= 0 C Co = 0
< = = 0

FAS FA2 S FAI S FAo S

Cy)
II

I
V V V
v

S2 So
53 Si

O I I I

10 10 > 10

+
11 01 - 12

O ( I

y
I 23