LAPORAN TUGAS

ELEKTRONIKA DIGITAL

DOSEN PENGAJAR
Subandi, S.T., M.Kom.

Oleh :
Wahid Fadholi
NIM : C030318125
Kelas
TI – 1 AXIOO

POLITEKNIK NEGERI BANJARMASIN

JURUSAN TEKNIK ELEKTRO
PRODI TEKNIK INFORMATIKA
TAHUN 2018
 GERBANG LOGIKA

Gerbang AND Tabel Kebenaran

A B F
0 0 0
0 1 0
1 0 0
1 1 1

Gerbang OR Tabel Kebenaran

A B F
0 0 0
0 1 1
1 0 1
1 1 1

Gerbang NOT Tabel Kebenaran

A B
1 0
0 1
Gerbang NAND
Tabel Kebenaran

A B F
0 0 1
0 1 1
1 0 1
1 1 0
Gerbang NOR
Tabel Kebenaran

A B F
0 0 1
0 1 0
1 0 0
1 1 0
 Fungsi Gerbang
Fungsi Gerbang NAND jadi OR Tabel Kebenaran

A B F
0 0 0
0 1 1
1 0 1
1 1 1

Fungsi Gerbang NOR jadi AND Tabel Kebenaran

A B F
0 0 0
0 1 0
1 0 0
1 1 1

Fungsi Gerbang NAND jadi AND Tabel Kebenaran

A B F
0 0 0
0 1 0
1 0 0
1 1 1
Fungsi Gerbang NOR jadi OR Tabel Kebenaran

A B F
0 0 0
0 1 1
1 0 1
1 1 1

Fungsi Gerbang NAND jadi NOT Tabel Kebenaran

A F
0 1
1 0

Fungsi Gerbang NOR jadi NOT Tabel Kebenaran

A F
0 1
1 0
 RANGKAIAN FLIP-FLOP
Rangkaian R-S Flip-Flop NOR Tabel Kebenaran

S R Q Q’
0 0 Q Q’
0 1 0 1
1 0 1 0
1 1 0 0

Rangkaian R-S Flip-Flop NAND Tabel Kebenaran

R S Q Q’
0 0 1 1
0 1 0 1
1 0 1 0
1 1 Q Q’

Rangkaian R-S-T Flip-Flop Tabel Kebenaran

R S T Q Q’
0 X X Q Q’
1 0 0 Q Q’
1 0 1 0 1
1 1 0 1 0
1 1 1 1 1
Rangkaian D Flip-Flop Tabel Kebenaran

D T Q Q’
0 X Q Q’
1 0 0 1
1 1 1 0

Rangkaian J-K Flip-Flop Tabel Kebenaran

K T J Qn+1 Q’n+1
0 X X Qn Q’n
1 0 0 Qn Q’n
1 0 1 0 1
1 1 0 1 0
1 1 1 Q’n Qn
 FUNGSI BOOLEAN

f = x’y’z + x’yz + xy’ Tabel Kebenaran

x y z f
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0

y = AC + BC’ + A’BC Tabel Kebenaran

A B C y
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
z = (A + B)(C + D)(A’ + B + D) Tabel Kebenaran

A B C D z
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 1
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 1
1 0 1 0 0
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

x = (AB + A’B’)(CD’ + C’D) Tabel Kebenaran

A B C D y
0 0 0 0 0
0 0 0 1 1
0 0 1 0 1
0 0 1 1 0
0 1 0 0 0
0 1 0 1 1
0 1 1 0 1
0 1 1 1 0
1 0 0 0 0
1 0 0 1 1
1 0 1 0 1
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 1
1 1 1 1 0
 PENYEDERHANAAN FUNGSI BOOLEAN SECARA ALJABAR

1. Z = (A’ + B)(A + B)
= A’A + A’B + AB + BB
= A’A + B(A’ + A) + BB
=0+B+B
=B

2. Z = (A’ + B)(A + B + D)D’

= (A’ + B) (D’A + BD’ + DD’)
= (A’ + B) (D’(A + B) + 0)
= (A’ + B) (A + B) D’
= (A’A + A’B + AB + BB) D’
= (0 + B(A’ + A) + B) D’
= (B + B) D’
= BD’

3. Z = (B + C’)(B’ + C) + (A’ + B + C’)’

= (BB’ + BC + C’B’ +CC’) + (A .B’ . C)
= (0 + BC + C’B’ + 0) + (A .B’ . C)
= BC + C’B’ + AB’C
= BC + B’(C’ + AC)

4. F = X’YZ + X’YZ’ + XZ
= X’(YZ + YZ’) + XZ
= X’(Y(Z + Z’)) + XZ
= X’Y + XZ
 DECODER Tabel Kebenaran

A B E D0 D1 D2 D3
1 X X 1 1 1 1
0 0 0 0 1 1 1
0 0 1 1 0 1 1
0 1 0 1 1 0 1
0 1 1 1 1 1 0

ENCODER

1 2 3 4 5 6 7 8 A B C
1 0 0 0 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0 1
0 0 1 0 0 0 0 0 0 1 0
0 0 0 1 0 0 0 0 0 1 1
0 0 0 0 1 0 0 0 1 0 0
0 0 0 0 0 1 0 0 1 0 1
0 0 0 0 0 0 1 0 1 1 0
0 0 0 0 0 0 0 1 1 1 1