DS W02S01 Intoduction To Logic Circuits
DS W02S01 Intoduction To Logic Circuits
9/17/2019 GFP 2
Outlines
Variables
Functions
Inversion and Truth Tables.
Syhenthesis using AND, OR, and NOT gates
Logic Gates
Boolean Algebra
9/17/2019 GFP 3
Logika Biner dan Gerbang Logika (Gates)
Note:
1 + 1 = 2 (dibaca “one plus one equals two”)
tidak sama dengan
1 + 1 = 1 (dibaca “1 OR 1 sama dengan 1”).
Definisi Operator
Operasi didefinisikan pada nilai “0” dan
“1” untuk setiap operator:
AND OR NOT
0·0=0 0+0=0 0= 1
0·1=0 0+1=1 1= 0
1·0=0 1+0=1
1·1=1 1+1=1
Truth Tables
Truth table : tabel berisi nilai input dan output
dari suatu fungsi untuk semua kombinasi yang
mungkin ada.
Contoh : Truth tables pada operasi logika dasar
AND OR NOT
X Y Z = X·Y X Y Z = X+Y X Z=X
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1 1 1 1
Implementasi Fungsi logika
Using Switches Switches in parallel => OR
◦ For inputs:
logic 1 is switch closed
logic 0 is switch open
◦ For outputs:
logic 1 is light on Switches in series => AND
logic 0 is light off.
◦ NOT uses a switch
such
that: Normally-closed switch => NOT
logic 1 is switch open C
logic 0 is switch closed
Implementasi Fungsi logika (lanjutan)
D
Lampu menyala (L = 1) untuk
L(A, B, C, D) =
dan sebaliknya lampu off (L = 0).
Gerbang Logika (Logic Gates)
Y 0 1 0 1
Y 0 1 0 1
(AND) X ·Y
(AND) X · Y
0 0 00 00 1
1
(OR)(OR)X 1XY1 Y 0 0 11 11 11
(NOT) X 1 1 0 0
(NOT) X 1 1 0 0
(b) Timing diagram
Gate Delay
1
Input
0
tG tG tG = 0.3
1 ns
Output
0
0 0.5 1 1.5 Time (ns)
Ekspresi dan Diagram Logika
Truth Table Persamaan
XYZ F = X + Y Z
000 0 F = X +Y Z
001 1
010 0 Diagram Logika
011 0 X
100 1
Y F
101 1
110 1 Z
111 1
Another expression
Truth Table
Three-input AND and OR operations.
Truth Table
x
Logic F
y
Diagram
z
COMBINATIONAL GATES
Name Symbol Function Truth Table
A B X
A X=A•B 0 0 0
AND X or 0 1 0
1 0 0
B X = AB 1 1 1
A B X
A 0 0 0
OR X X=A+B 0 1 1
1 0 1
B 1 1 1
A X
I 0 1
A X X = A’ 1 0
A X
0 0
Buffer A X X=A 1 1
A B X
A 0 0 1
NAND 0 1 1
X X = (AB)’ 1 0 1
B 1 1 0
A B X
A 0 0 1
NOR X X = (A + B)’ 0
1
1
0
0
0
B 1 1 0
A B X
A X=AB
XOR X or
0
0
0
1
0
1
Exclusive OR 1 0 1
B X = A’B + AB’
1 1 0
A B X
A X = (A B)’
XNOR X or
0
0
0
1
1
0
Exclusive NOR
B X = A’B’+ AB 1 0 0
or Equivalence 1 1 1
Boolean Algebra
In 1849 George Boole published
a scheme for the algebraic
description of processes
involved in logical thought and
reasoning and became known
as Boolean algebra.
Step:
1. which the output function f has to be 1.
Chapter 2 - Part 1 37
Maxterm Function Example
Example: Implement F1 in maxterms:
F1 = M0 · M2 · M3 · M5 · M6
F1 = (x+ y + z)·(x+ y + z)·(x+ y + z)
·(x + y + z)·(x + y + z)
xyz i M0 M2 M3 M5 M6 = F1
000 0 0 1 1 1 1 =0
001 1 1 1 1 1 1 =1
010 2 1 0 1 1 1 =0
011 3 1 1 0 1 1 =0
100 4 1 1 1 1 1 =1
101 5 1 1 1 0 1 =0
110 6 1 1 1 1 0 =0
111 7 1 1 1 1 1 =1
Maxterm Function Example
F (A , B, C , D) =M 3 M 8 M11 M14
F(A, B,C,D) =
SUM of Product (SOP) and
Product of SUM (POS)
Standard Forms
Standard Sum-of-Products (SOP) form: equations
are written as an OR of AND terms
Standard Product-of-Sums (POS) form: equations
are written as an AND of OR terms
Examples:
◦ SOP: A BC + A BC + B
◦ POS: (A+ B)· (A+ B + C )·C
These “mixed” forms are neither SOP nor POS
◦
◦ (A B + C) (A + C)
A B C + A C (A+ B)
SUM of Product (SOP) : Minterm
Example 1
0 0 1
0 1 1
1 0 0
1 1 1
SUM of Product (SOP)
Example 2
Logic Circuit?
Product of SUM (POS) : Maxterm
Truth Table
0 0 1
0 1 1
1 0 0 If we complement this expression
1 1 1 using DeMorgan’s theorem, the
result is
Using the commutative property 10b and the associative property 11b
or more simply
Back to Problem last week
9/17/2019 GFP 55
Design Examples
Asumsi ada ruangan besar dengan tiga pintu dan disetiap
pintu anda switch untuk mengontrol lampu pada ruangan.
Harus memungkinkan menyalakan dan mematikan lampu
dengan mengubah state salah satu switch.
Solusi
9/17/2019 GFP 56
Design Examples – Multiplexer Circuit
In computer systems it is often necessary to choose data from
exactly one of a number of possible sources. Suppose that there are
two sources of data, provided as input signals x1 and x2. The
valuesof these signals change in time, perhapsat regular intervals.
Thus sequencesof 0sand 1sare applied on each of the inputs x1 and
x2. We want to design a circuit that producesan output that hasthe
same value aseither x1 or x2, dependent on the value of a selection
control signal s. Therefore, the circuit should have three inputs: x1,
x2, and s. Assume that the output of the circuit will be the same as
the value of input x1 if s = 0, and it will be the same as x2 if s = 1
9/17/2019 GFP 57
Design Examples – Multiplexer Circuit
9/17/2019 GFP 58
EOF
9/17/2019 GFP 59