Deco Unit 1
Deco Unit 1
circuit
Unit-1
A logic gate is an electronic circuit that performs logical
operations based on the inputs provided to it and produces a
logical output that can be either "true" or "false".
Logic gates are the primary building blocks of all digital circuits
and systems. The operation of logic gates is based on the
Boolean mathematics.
Input Output
A B Y
0 0 0
0 1 0
1 0 0
1 1 1
Boolean Expression of AND Gate
Y=A·B
OR GATE
An OR gate is a type of logic gate used to perform logical
addition. It can have two or more inputs and one output.
The output of the OR gate is low or logic 0 only when all its
inputs are low or logic 0. For rest input combinations, the output
of the OR gate is high or logic 1.
The logic symbols for a two-input and a three-input OR gate are
shown in the following figure.
,
Truth Table of OR Gate
Input Output
A B Y
0 0 0
0 1 1
1 0 1
1 1 1
Boolean Expression of
NOT Gate
Y=A¯=A′Y=A¯=A′
The NAND gate can have two or more input lines and one output
line. The output of the NAND gate is low or logic 0 only when all
its inputs are high or logic 1. Otherwise, the output of the NAND
gate is high or logic 1.
Tfollo
Logic Symbol of NAND
Gate
Truth Table of NAND Gate
Input Output
A B Y
0 0 1
0 1 1
1 0 1
1 1 0
NOR Gate
The NOR gate is another universal gate used in digital electronics
to implement Boolean functions. It is a combination of two basic
logic gates namely, OR gate and NOT gate. The NOR gate is
designed by connecting a NOT gate to the output line and the final
output is taken from the output line of the NOT gate as shown in the
following figure.
Logic Symbol of NOR Gate
The logic symbols of a two-input and three-input NOR gates are
shown in the following figure.
Input Output
A B Y
0 0 1
0 1 0
1 0 0
1 1 0
XOR Gate
The XOR gate is a logic gate that has two inputs and one output.
The XOR gate produces a HIGH (Logic 1) output when one and
only one of its two inputs are HIGH (Logic 1). When both inputs
of the XOR gate are HIGH (Logic 1) or LOW (Logic 0), then the
output of the XOR gate is a LOW (Logic 0) state.
⟮A+B⟯′=A′⋅B′
each of the individual variables, i.e.
⟮AB⟯′=A′+B′
variables, i.e.
S.No. SOP POS
6 In SOP, we can get the In POS, we can get the final term
final term by adding the by multiplying the sum terms.
product terms.
Karnaugh Map
K-Map is one of the most efficient simplification tools when the
number of variables in the Boolean expression are less than or
equal to four.
The K-Map or Karnaugh map makes the use of two dimensional
table for simplification of the Boolean functions. The size of this
table increases considerably with the increase in the number of
variables in the Boolean functions.
Solving an Expression Using K-Map
Here are the steps that are used to solve an expression using the
K-map method:
1. Select a K-map according to the total number of variables.
2. Identify maxterms or minterms as given in the problem.
3. For SOP, put the 1’s in the blocks of the K-map with respect to
the minterms (elsewhere 0’s).
4. For POS, putting 0’s in the blocks of the K-map with respect to
the maxterms (elsewhere 1’s).
5. Making rectangular groups that contain the total terms in the
power of two, such as 2,4,8 ..(except 1) and trying to cover as
many numbers of elements as we can in a single group.
6. From the groups that have been created in step 5, find the
product terms and then sum them up for the SOP form.