Tambahan Komplemen1
Tambahan Komplemen1
H I DAYAT
J U R U S A N T E K N I K KO M P U T E R
U N I KO M
2009
Penjumlahan bil. biner
Mari kita hitung :
0+0=0
0+1=1
1+0=1
1 + 1 = 0, carry 1
Pengurangan bil. biner
Mari kita hitung :
0-0=0
1-0=1
1-1=0
10 - 1 = 1
Bilangan tak bertanda
Bilangan yang tidak memiliki tanda ‘+’ ataupun ‘-’
Contoh :
bilangan 8 bit : 0000000 - 11111111
: 00 - FFH
: 0 – 255
Sum 0 0 0 0
Half 0 1 1 0
Adder 1 0 1 0
Cout
1 1 0 1
Half Adder (1-bit)
A A B S(um) C(arry)
Sum 0 0 0 0
B
0 1 1 0
1 0 1 0
1 1 0 1
Carry
S AB A B A B
C AB
Full Adder
Cin A B S(um) Cout
0 0 0 0 0
A B 0 0 1 1 0
0 1 0 1 0
Sum 0 1 1 0 1
Carry In Full 1 0 0 1 0
(Cin) Adder 1 0 1 0 1
Cout
1 1 0 0 1
1 1 1 1 1
Full Adder
Cin A B S(um) Cout
AB
Cin 00 01 11 10 0 0 0 0 0
0 1 0 1 0 0 1 1 0
0
1 0 1 0
0 1 0 1 0
1
0 1 1 0 1
S Cin A B Cin AB CinAB Cin A B
1 0 0 1 0
Cin( A B AB) Cin (AB A B)
1 0 1 0 1
Cin( A B) Cin (A B) 1 1 0 0 1
Cin A B
1 1 1 1 1
AB AB
Cin 00 01 11 10 Cin 00 01 11 10
0 0 0 1 0 0 0 0 1 0
Or
1 0 1 1 1 1 0 1 1 1
B Sum
Cin
Co
Full Adder
Sum Cin A B
Cout AB Cin(A B)
A Sum
A Sum A Sum
Half Half
Adder Adder
B B Co B Co Co
Cin
Full Adder
Sum Cin A B
Cout CinB CinA AB
4-bit Ripple Adder using Full Adder
A3 B3 A2 B2 A1 B1 A0 B0
A B A B A B A B
Carry Full Full Full Full
Cout Cin Cout Cin Cout Cin Cout Cin
Adder Adder Adder Adder
S S S S
S3 S2 S1 S0
S A S A
B H.A.H.A. B
Cout
C Cin
Full Adder
Half Adder
Disain Subtractor
B3 B2 B1 B0
Subtract
A3 A2 A1 A0
A B A B A B A B
C Full Full Full Full
Cout Cin Cout Cin Cout Cin Cout Cin
Adder Adder Adder Adder
S S S S
S3 S2 S1 S0
A – B = A + (-B)
Lakukan komplemen 2 pada B
Jadikan penjumlahan A dan komplemen 2 dari B
ADDER/SUBSTRACTOR UNIT