Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
ELECTRONICS
AND GATE
OR GATE
NOT GATE
NAND GATE
NOR GATE
X-OR GATE
X-NOR GATE
BUBBLED AND GATE
BUBBLED OR GATE
BUBBLED NAND GATE
An AND gate has two or more inputs but only one output. The output assumes the logic 1
state, only when each one of its inputs is at logic 1 state. The output assumes the logic O state
even if one of its inputs is at logic 0 state. The AND gate may, therefore, be defined as a
device whose output is 1, if and only if all its inputs are 1. Hence the AND gate is also called
an all or nothing gate.
TRUTH TABLE
A B Output
0 0 0
0 1 0
1 0 0
1 1 1
OR GATE
Like an AND gate, an OR gate may have two or more inputs but only one output. The output
assumes the logic 1 state, even if one of its inputs is in logic 1 state. Its output assumes me
logic O state, only when each one of its inputs is in logic O state. An OR gate may, therefore,
be defined as a device whose output is 1, even if one of its inputs is 1. Hence an OR gate is
also called an any or all gate. It can also be called an inclusive OR gate because it includes the
condition 'both inputs can be present'.
TRUTH TABLE
A B Output
0 0 0
0 1 1
1 0 1
1 1 1
NOT GATE
A NOT gate. Also called an inverter, has only one input and, of course, only one output. It is a
device whose output is always the complement of its input. That is, the output of a NOT gate
assumes the logic 1 state when its input is in logic 0 state and assumes the logic 0 state when
its input is in logic 1 state. The logic symbol and the truth table of an inverter are shown in
Figures.
TRUTH TABLE
A Output
0 1
1 0
NAND GATE
This is a NOT-AND gate which is equal to an AND gate followed by a NOT gate. The outputs of
all NAND gates are high if any of the inputs are low. The symbol is an AND gate with a small
circle on the output. The small circle represents inversion.
TRUTH TABLE
A B Output
0 0 1
0 1 1
1 0 1
1 1 0
NOR GATE
This is a NOT-OR gate which is equal to an OR gate followed by a NOT gate. The outputs of all NOR
gates are low if any of the inputs are high. The symbol is an OR gate with a small circle on the output.
The small circle represents inversion. The logic symbol and the truth table of a two-input NOR
gates are shown in Figures. TRUTH TABLE
A B Output
0 0 1
0 1 0
1 0 0
1 1 0
X-OR GATE
The 'Exclusive-OR' gate is a circuit which will give a high output if either, but not both, of its
two inputs are high. An encircled plus sign (⊕) is used to show the X-OR operation. An X-OR
gate is a two input, one output logic circuit. X-OR gate assumes logic 1 state when any of its
two inputs assumes a logic 1 state. When both the inputs assume the logic 0 state or when
both the inputs assume the logic 1 state, the output assumes a logic 0 state.
TRUTH TABLE
A B Output
0 0 0
0 1 1
1 0 1
1 1 0
X-NOR GATE
The 'Exclusive-NOR' gate circuit does the opposite to the X-OR gate. It will give a low output if
either, but not both, of its two inputs are high. The symbol is an X-OR gate with a small circle
on the output. The small circle represents inversion. It can be used as an equality detector
because output is a 1 only when its inputs are equal.
TRUTH TABLE
A B Output
0 0 1
0 1 0
1 0 0
1 1 1
BUBBLED AND GATE
NOR gate is equivalent to an AND gate with inverted inputs and the corresponding output
̅𝑩
expression is X=𝑨 ̅ . So, NOR function and also be realized by first inverting the inputs and
then AND in those inverted inputs. Thus, a NOR gate is combination of two NOT gates and an
AND gate. Hence, form figure we can see that the output of a two-input NOR gates is:
̅̅̅̅̅̅̅̅
X=𝑨 + 𝑩=𝑨 ̅𝑩
̅
TRUTH TABLE
A B Output
0 0 1
0 1 0
1 0 0
1 1 0
BUBBLED OR GATE
The OR gate with inverted inputs is called a bubbled OR gate. Here, we see that the output X is 1 when
either A=0 or B=0 or when both A and B are equal to 0, i.e. If either 𝑨 ̅ = 1 or 𝑩
̅ = 1 or both A and B are
equal to 1. Therefore, the NAND gate can perform the OR function. So, a NAND function can also be
realized by first inverting the inputs and then OR ing the inverted inputs. Thus, a NAND gate is a
combination of two NOT gates and an OR gate .Here, X = 𝑨𝑩 ̅̅̅̅ = 𝑨
̅ +𝑩
̅
TRUTH TABLE
A B Output
0 0 1
0 1 1
1 0 1
1 1 0
BUBBLED NAND GATE
A B Output
0 0 0
0 1 1
1 0 1
1 1 1
BUBBLED NOR GATE
TRUTH TABLE
A B Output
0 0 0
0 1 0
1 0 0
1 1 1