Logic Gates
Logic Gates
Logic Gates
These are
important digital devices that are mainly based on the Boolean function. Logic gates are
used to carry out logical operations on single or multiple binary inputs and give one
binary output. In simple terms, logic gates are the electronic circuits in a digital system.
In this lesson, we will further look at the different types of basic logic gates with their
truth table and understand what each one is designed for.
OR Gate
AND Gate
NOT Gate
XOR Gate
Additionally, these gates can also be found in a combination of one or two. Therefore,
we get other gates, such as NAND Gate, NOR Gate, EXOR Gate and EXNOR Gate.
OR Gate
In an OR gate, the output of an OR gate attains state 1 if one or more inputs attain state
A B Y
0 0 0
0 1 1
1 0 1
1 1 1
AND Gate
In the AND gate, the output of an AND gate attains state 1 if and only if all the inputs are
in state 1.
A B Y
0 0 0
0 1 0
1 0 0
1 1 1
NOT Gate
In a NOT gate, the output of a NOT gate attains state 1 if and only if the input does not
attain state 1.
A Y
0 1
1 0
When connected in various combinations, the three gates (OR, AND and NOT) give us
basic logic gates, such as NAND and NOR gates, which are the universal building
blocks of digital circuits.
NAND Gate
This basic logic gate is the combination of AND and NOT gates.
A B Y
0 0 1
0 1 1
1 0 1
1 1 0
NOR Gate
This gate is the combination of OR and NOT gates.
A B Y
0 0 1
0 1 0
1 0 0
1 1 0
A B Y
0 0 0
0 1 1
1 0 1
1 1 0
A B Y
0 0 1
0 1 0
1 0 0
1 1 1
One of the primary benefits is that basic logic gates can be used in various
combinations if the operations are advanced. Besides, there is no limit to the number of
gates that can be used in a single device. However, it can be restricted due to the given
physical space in the device. In digital integrated circuits (ICs), we will find an array of
the logic gate area unit.
De Morgan’s Theorem
The first theorem – It states that the NAND gate is equivalent to a bubbled OR gate.
�.�¯=�¯+�¯
The second theorem – It states that the NOR gate is equivalent to a bubbled AND
gate.
�+�―=�¯.�¯
Important Conversions
1) The ‘NAND’ gate: From ‘AND’ and ‘NOT’ gates.
Boolean expression and truth table
�=�.�―
A B Y′=A⋅B �=�.�―
0 0 0 1
0 1 0 1
1 0 0 1
1 1 1 0
�=�+�―
A B Y′=A+B �=�+�―
0 0 0 1
0 1 1 0
1 0 1 0
1 1 1 0
(3) The ‘XOR’ gate: From ‘NOT’, ‘AND’ and ‘OR’ gates.
The logic gate, which gives a high output (i.e., 1) if either input A or input B but not both
are high (i.e. 1), is called the exclusive OR gate or the XOR gate. It may be noted that if
both the inputs of the XOR gate are high, then the output is low (i.e., 0).
�.�¯+�¯.�
or
�=�⨁�
A B Y
0 0 0
0 1 1
1 0 1
1 1 0
Boolean expression
�=(�⨁�)¯
A B Output
0 0 1
0 1 0
1 0 0
1 1 1
AND gate, OR gate, XOR gate, NAND gate, NOR gate, XNOR gate and NOT gate are
the seven types of basic logic gates.
Q3
A universal gate is a logic gate that can implement any Boolean function without using
another logic gate. The universal gates are the NOR and NAND gates.