DIGITAL LOGIC DESIGN
(DLD)
Lecture # 4
Digital Logic Gates
University of Management & Technology
BASIC LOGIC GATES
AND BASIC DIGITAL DESIGN
NOT, AND, and OR Gates
NAND and NOR Gates
DeMorgans Theorem
Exclusive-OR (XOR) Gate
Multiple-input Gates
2
DIGITAL LOGIC GATES
The basic building blocks of a computer are called
logical gates or just gates.
Gates are basic circuits that have at least one
(and usually more) input and exactly one output.
Input and output values are the logical values
true and false.
In computer architecture it is common to use 0
for false and 1 for true.
DIGITAL LOGIC GATES
Gates have no memory. The value of the
output depends only on the current value of
the inputs.
Their output is the truth table. In a truth
table, the value of each output is shown for
every possible combination of the input
values.
There are three basic kinds of gates, andgates, or-gates, and not-gates (or inverters).
NOT Gate (Inverter)
ANOT gate(also often calledInverter) is a
logic gate.
It takes one input signal. In logic, there are usually
two states, 0 and 1.
The
gate therefore sends1as output, if it
receives0as input. Alternatively it received1as
input, and sends0as output.
NOT Gate (Inverter)
One
Onebit
bitas
asinput
inputproduces
producesits
itsopposite
oppositeas
asoutput.
output.
NOT GATE -- INVERTER
X
~X
~~X = X
X ~X ~~X
0 1 0
1 0 1
AND GATE
AND
X
Z
The AND gate is a
basic digital logic
gate
that
implements
logical conjunction
Y
Z = X & Y
AND GATE
Two
Two or
or more
more input
input bits
bits produce
produce one
one output
output
bit.
bit.
Both
Both inputs
inputs must
must be
be true
true (1)
(1) for
for the
the output
output to
to
be
be true.
true.
Otherwise
Otherwise the
the output
output is
is false
false (0).
(0).
AND GATE
In order for current to flow, both switches
must be closed
Logic notation AB = C
(Sometimes AB = C)
10
OR GATE
OR
X
Y
Z = X | Y
11
OR GATE
Two
Two or
or more
more input
input bits
bits produce
produce one
one output
output bit.
bit.
Either
Either inputs
inputs must
must be
be true
true (1)
(1) for
for the
the output
output to
to
be
be true.
true.
12
OR GATE
Current flows if either switch is closed
Logic notation A + B = C
13
NAND GATE
NAND
X
Z
Y
Z = ~(X & Y)
nand(Z,X,Y)
14
NAND GATE
AND-NOT
X
W
Y
W = X & Y
Z = ~W = ~(X & Y)
15
NAND GATE
ab
(ab)
16
NOR GATE
NOR
X
Y
Z = ~(X | Y)
nor(Z,X,Y)
17
NOR GATE
OR-NOT
X
X
0
0
1
1
Y
0
1
0
1
W
0
1
1
1
Z
1
0
0
0
W = X | Y
Z = ~W = ~(X | Y)
18
NOR GATE
a
a+b
(a+b)
19
DE MORGANS THEOREM-1
~(X & Y) = ~X | ~Y
NOT all variables
Change & to | and | to &
NOT the result
20
NAND GATE (DE MORGANS )
X
Y
Z = ~(X & Y)
X
0
0
1
1
Y
0
1
0
1
W
0
0
0
1
Z
1
1
1
0
Z = ~X | ~Y
X
0
0
1
1
Y ~X ~Y
0 1 1
1 1 0
0 0 1
1 0 0
Z
1
1
1
0
21
DE MORGANS THEOREM-2
~(X | Y) = ~X & ~Y
NOT all variables
Change & to | and | to &
NOT the result
22
NOR GATE (DE MORGANS )
X
Z = ~(X | Y)
X
0
0
1
1
Y
0
1
0
1
Z
1
0
0
0
Z = ~X & ~Y
X
0
0
1
1
Y ~X ~Y
0 1 1
1 1 0
0 0 1
1 0 0
Z
1
0
0
0
23
EXCLUSIVE-OR GATE
XOR
X
Y
Z = X ^ Y
xor(Z,X,Y)
X Y
Z
0 0 0
0 1 1
1 0 1
1 1 0
24
EXCLUSIVE-NOR GATE
XNOR
X
Y
Z = ~(X ^ Y)
Z = X ~^ Y
xnor(Z,X,Y)
X Y
Z
0
0
1
1
0
1
0
1
Z
1
0
0
1
25
MULTIPLE-INPUT GATES
Z1
Z2
Z3
Z4
26
MULTIPLE-INPUT AND GATE
Z1
Output Z 1 is HIGH only if all inputs are HIGH
An open input will float HIGH
27
MULTIPLE-INPUT OR GATE
Z2
Output Z 2 is LOW only if all inputs are LOW
28
MULTIPLE-INPUT NAND GATE
Z3
Output Z 3 is LOW only if all inputs are HIGH
29
MULTIPLE-INPUT NOR GATE
Z4
Output Z 4 is HIGH only if all inputs are LOW
30