MATA KULIAH

ELEKTRONIKA DIGITAL

Oleh : Misbah, ST, MT

Univ. Muhammadiyah Gresik

PERANGKAT DIGITAL
SISTEM BILANGAN
 Biner (basis 2) { 0,1}
 Oktal (basis 8) {0,1,2,3,4,5,6,7}
 Desimal (basis 10) {0,1,2,3,4,5,6,7,8,9}
 Hexadesimal (basis 16)
{0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F}

Contoh : (123)10= 1x102+2x101+3x100

= 1x100+2x10+3x1
KONVERSI BILANGAN
Desimal ke Biner Desimal ke Oktal
Contoh : (22)10 = ( 10110)2 Contoh : (87)10 = (127)8
Penyelesaian: Penyelesaian:
22 / 2 sisa 0 87 / 8 sisa 7
11 / 2 sisa 1 10 / 8 sisa 2
5/2 sisa 1 1
2/2 sisa 0
Desimal ke Hexa
1
Contoh : (30)10 = (1E )16
Penyelesaian:
30 / 16 sisa 14 (E)
1
SOAL :

 1. (459)10 = ( )2
 2. (320)10 = ( )8
 3. (257)10 = ( )16
LANJUTAN (1)
 Biner ke Desimal
Contoh = (1110110)2 = ( 118)10
1x26+1x25 +1x24 +0x23
+1x22+1x21+0x20=118

 Biner ke Hexadesimal
Contoh = (1110110)2 = (76)16
0111 0110
7 6
 Biner ke Oktal
Contoh = (1110110)2 = ( 166 )8
01 110 110
1 6 6
SOAL :

 (101110100)2 = ( )8
 (1110110110)2 = ( )16
 (1100101101)2 = ( )10
LANJUTAN (2)
 Hexadesimal ke desimal
Contoh : (A6)16 = (166)10
10x161+6x160 =160+6 = 166
 Hexadesimal ke biner
Contoh : (F4)16 = (11110100)2
F 4
1111 0100
 Hexadesimal ke oktal
Contoh : (F4)16 = (364)8
F 4
11110100
3 6 4
SOAL :

 (F12)16 = ( )10
 (ABC)16 = ( )8
 (D20)16 = ( )2
LANJUTAN (3)
 Oktal ke Biner
Contoh : (36)8 = (011110)2
3 6
011 110
 Oktal ke Desimal
Contoh = (543)8 = (355)10
5x82+4x81 +3x80 =320+32+3 = 355
 23 22 21 20 Hexa/oktal
TABEL 0 0 0 0 0

KONVERSI 0
0
0
0
0
1
1
0
1
2

Hexa/Oktal ke Biner 0 0 1 1 3
0 1 0 0 4
0 1 0 1 5
0 1 1 0 6
0 1 1 1 7
1 0 0 0 8
1 0 0 1 9
1 0 1 0 A
1 0 1 1 B
1 1 0 0 C
1 1 0 1 D
1 1 1 0 E
1 1 1 1 F
SOAL :
ISTILAH DALAM DIGITAL

1 0 1 1 0 1 0 1

 1 Bit/digit
 1 Byte = 8 bit, memuat satu informasi data.

1 0 1 1 0 1 0 1 Karakter ‘A’
OPERASI BILANGAN BINER
Sum 0 1
 Penjumlahan 0 0 1
1 0 0+carry

Contoh 1: Contoh 2: Contoh 3:

001101 1011011 110111011
100101+ 1011010+ 100111011+
110010 10110101 1011110110

Contoh 4:
1010
0111
1011 +
OPERASI BILANGAN BINER (2)

 Perkalian
Contoh 2:
Contoh 1:
110110111
110101
1010111 x
111 x
110101 110110111
110110111
110101
110110111
110101
000000000
101110011
110110111
000000000
110110111
1001010100110001
OPERASI BILANGAN BINER (3)

 Pengurangan Subtract 0 1
0 0 1
1 1+borrow 0

Contoh 1:
10110 Contoh 2:
01010- 11011001
01100 10101011-
00101110
Complement :
1’s complement=(2n-N)-1
2’s complement= (2n-N)

Contoh: carilah 2’s complement dari N=(101101)2 =(45)10  n=6

26 = 64
2n-N = 64-45=19 = 010011

Contoh : 1’s complement dari (100101)2 = (011010)2

Kesimpulan :
1’s complement = tiap bit di-invers
2’s complement = 1’s complement + 1
OPERASI PENGURANGAN DENGAN KOMPLEMEN

 1’s Complement

Contoh 1:
10111011 10111011
01100110 -  1’s 10011001 +
(1) 01010100

Contoh 2:
101110100111 101110100111 Extra : (1) positif
(0) negatif
110110110111 -  1’s 001001001000 +
110111101111
OPERASI BILANGAN BINER (4)

 Pembagian
Contoh 1: Contoh 2:
1100 1001
110 1001000 1001 1010001
- 110 - 1001
00110 0001001
-110 -1001
0000000 0000000
TUGAS :
TEOREMA BOOLEAN ALJABAR
 Hukum Komutatif  Hukum Identitas
1. A + B = B + A 1. A + A = A
2. A . B = B . A 2. A . A = A
 Hukum Asosiatif  Hukum Negasi
1. (A+B)+C=A+(B+C) 1. (A) = A
2. (A.B).C=A.(B.C) 2. (A) = A
 Hukum Distributif  Hukum Redundansi
1. A.(B+C)=A.B+A.C 1. A+A.B = A
2. A+(B.C)=(A+B).(A+C)
2. A.(A+B)= A
TEOREMA BOOLEAN ALJABAR (2)
 T7 :
 T10 :
1. 0+A=A
1. (A + B) = A . B
2. 1.A=A
3. 1+A=1 2. (A . B)= A + B

4. 0.A=0
 T8 :
1. A+A=1
2. A.A=0
 T9 :
1. A + A.B = A+B
2. A . (A+B)= A . B
BOOLEAN ALJABAR
TABEL KEBENARAN :

A B A AND B A B A OR B
0 0 0 0 0 0
0 1 0 0 1 1
1 0 0 1 0 1
1 1 1 1 1 1

NB : ‘0’ menyatakan Salah

A NOT A ‘1’ menyatakan Benar

0 1
1 0
FUNGSI ALJABAR BOOLEAN

 Contoh : carilah tabel kebenaran F = A.B + B.A

A B A.B B.A F
0 0 0 0 0
0 1 0 0 0
1 0 0 1 1
1 1 1 0 1
FUNGSI ALJABAR BOOLEAN (2)

 Contoh : carilah tabel kebenaran F = A.B.C +

A.B + B.C
A B C A.B.C A.B B.C F
22 21 20
0 0 0 0 0 0 0
0 0 1 0 0 0 0
0 1 0 0 0 1 1
0 1 1 1 0 0 1
1 0 0 0 0 0 0
1 0 1 0 0 0 0
1 1 0 0 1 1 1
1 1 1 0 1 0 1
FUNGSI A
23
B
22
C
21
D
20
ABC
D
ABC BCD ACD
D
F

ALJABAR 0 0 0 0
BOOLEAN (3) 0 0 0 1
0 0 1 0
 Contoh :
0 0 1 1
carilah 0 1 0 0
tabel 0 1 0 1

kebenaran 0 1 1 0
0 1 1 1
F = A.B.C.D 1 0 0 0
+ A.B.C.D + 1 0 0 1

B.C.D + 1 0 1 0
1 0 1 1
A.C.D 1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1
PENYEDERHANAAN FUNGSI ALJABAR BOOLEAN

Contoh 1: F= A.B + A.B + A.B (sederhanakan)

Jawab : F = A.B + A.B + A.B = (A + A).B + A.B
= 1 . B + A.B
= B + A.B
=B+A
Contoh 2: F= A + A.B + A.B (sederhanakan)
Jawab : F= A + A.B + A.B = (A + A.B) + A.B
= A + A.B
=A+B
PENYEDERHANAAN FUNGSI ALJABAR BOOLEAN

Contoh 3: F= A.B + A.B (sederhanakan)

Jawab : F = A.B + A.B = (A.B) . (A.B)
= (A+B) . (A+B)
= A.A + A.B + B.A + B.B
= 0 + A.B + A.B + 0
= A.B + A.B
SOAL :