Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Gate types: NOT | AND | NAND | OR | NOR | EX-OR | EX-NOR
Symbols | Truth tables | Logic
ICs | Summary truth tables | Combinations | Substituting
Introduction Logic states
True False
Logic gates process signals which
represent true or false. Normally the positive supply 1 0
voltage +Vs represents true and 0V represents false. High Low
Other terms which are used for the true and false states +Vs 0V
are shown in the table on the right. It is best to be
familiar with them all. On Off
Note that logic gates are not always required because simple logic
functions can be performed with switches or diodes:
Truth tables
Input A Input B Output Q
A truth table is a good way to show the
function of a logic gate. It shows the output 0 0 0
states for every possible combination of input 0 1 0
states. The symbols 0 (false) and 1 (true) are 1 0 0
usually used in truth tables. The example truth 1 1 1
table on the right shows the inputs and output
of an AND gate.
The output Q is true when the input A is NOT true, the output is the inverse
of the input: Q = NOT A
A NOT gate can only have one input. A NOT gate is also called an inverter.
Input A Output Q
0 1
1 0
AND gate
The output Q is true if input A AND input B are both true: Q = A AND B
An AND gate can have two or more inputs, its output is true if all inputs are
true.
Input A Input B Output Q
0 0 0
0 1 0
1 0 0
1 1 1
This is an AND gate with the output inverted, as shown by the 'o' on the
output.
The output is true if input A AND input B are NOT both
true: Q = NOT (A AND B)
A NAND gate can have two or more inputs, its output is true if NOT all
inputs are true.
Input A Input B Output Q
0 0 1
0 1 1
1 0 1
1 1 0
OR gate
The output Q is true if input A OR input B is true (or both of them are
true): Q = A OR B
An OR gate can have two or more inputs, its output is true if at least one
input is true.
Input A Input B Output Q
0 0 0
0 1 1
1 0 1
1 1 1
This is an OR gate with the output inverted, as shown by the 'o' on the
output.
The output Q is true if NOT inputs A OR B are true: Q = NOT (A OR B)
A NOR gate can have two or more inputs, its output is true if no inputs are
true.
Input A Input B Output Q
0 0 1
0 1 0
1 0 0
1 1 0
The summary truth tables below show the output states for all types of 2-
input and 3-input gates.
Summary for all 2-input gates
Inputs
OR N Summary for all 3-input gates
OREX- Inputs Output of each gate
OREX-
A B C AND NAND OR NOR
NORO B
utput of 0 0 0 0 1 0 1
each
0 0 1 0 1 1 0
gate A
0A 0 1 0 0 1 1 0
ND 0 1 1 0 1 1 0
0 0 1 0 1 0 1
NA 1 0 0 0 1 1 0
ND
1 0 1 0 1 1 0
0 1 0 1 1 0 1 0
1 1 0 0 1 1 0
1 0 0 1 1 0 1 0
1 1 1 1 0 1 0
1 1 1 0 1 0 0 1
Q = A AND NOT B
D = NOT (A OR B)
E = B AND C
Q = D OR E = (NOT (A OR B)) OR (B AND C)
For example an OR gate can be built from NOTed inputs fed into a
NAND (AND + NOT) gate.
The table below shows the NAND gate equivalents of NOT, AND, OR and
NOR gates:
Gate Equivalent in NAND gates
NOT
AND
OR
NOR
To re-design this
system using NAND
gates only begin by replacing each gate with its NAND gate
equivalent, as shown in the diagram below.
Then simplify
the system by
deleting
adjacent pairs of
NOT gates
(marked X abov
e). This can be
done because
the second NOT
gate cancels the
action of the
first.
Substituting NAND (or NOR) gates does not always increase the
number of gates, but when it does (as in this example) the increase is
usually only one or two gates. The real benefit is reducing the
number of ICs required by using just one type of gate.