0% found this document useful (0 votes)
10 views19 pages

Deco Unit 1

Logic gates are electronic circuits that perform logical operations and are fundamental to digital circuits, classified into basic, universal, and derived types. They are used in various applications including digital computers, memory devices, and microprocessors. The document also covers specific gates like AND, OR, NOT, NAND, NOR, XOR, and XNOR, along with their truth tables, Boolean expressions, and simplification techniques such as DeMorgan's Theorem and Karnaugh Maps.

Uploaded by

amknightking001
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views19 pages

Deco Unit 1

Logic gates are electronic circuits that perform logical operations and are fundamental to digital circuits, classified into basic, universal, and derived types. They are used in various applications including digital computers, memory devices, and microprocessors. The document also covers specific gates like AND, OR, NOT, NAND, NOR, XOR, and XNOR, along with their truth tables, Boolean expressions, and simplification techniques such as DeMorgan's Theorem and Karnaugh Maps.

Uploaded by

amknightking001
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Logic gates and

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.

Types of Logic Gates-


Logic gates can be broadly classified into the following three
categories −
•Basic Logic Gates − AND Gate, OR Gate, NOT Gate
•Universal Logic Gates − NAND Gate and NOR Gate
•Derived Logic Gates − XOR Gate and XNOR Gate
Applications of Logic Gates

•Logic gates are used in digital computers to perform


arithmetic, logical, and control functions.

•In memory devices, logic gates are used to implement


memory cells to store digital data in the form of bits.

•Logic gates are used in manufacturing microprocessors and


microcontrollers.

•Logic gates are also used in digital communication systems to


perform functions like encoding, decoding, signal processing,
etc.
AND gate
An AND gate is a type of basic logic gate used in various digital
circuits
. and systems. It produces a high or logic 1 or True output,
only when all its inputs are high or logic 1 or true. For all other
combinations of inputs, it produces a low or logic 0 or False
output.
The logic symbols for the two and three input AND gates are

Here, A, B, and C are the input variables and Y is the output


variable.
Truth Table of AND Gate-

The truth table of a two-input AND gate is given below −

Input Output
A B Y
0 0 0
0 1 0
1 0 0
1 1 1
Boolean Expression of AND Gate

Boolean expression is a logic equation or a logic function that


represents the mathematical relationship between inputs and
output of the AND gate.
The Boolean expression of a two-input AND gate is given by,

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 OR Gate

The Boolean expression of a two-input OR gate is


given below −
Y=A+B
NOT GATE

The NOT gate is a type of basic logic gate used in digital


electronics to implement the inversion function. Since it performs
the inversion operation, it is also known as inverter.

The logic symbol of the NOT gate is shown in the


following figure −
Truth Table of NOT Gate

Input (A) Output (Y)


0 1
1 0

Boolean Expression of
NOT Gate
Y=A¯=A′Y=A¯=A′

Universal Gates NAND


and
A logic gate that can NOR any kind of possible
implement
Boolean function is called a universal gate. There are
two universal logic gates namely, NAND gate and NOR
gate.
NAND Gate
The NAND gate is a universal gate that basically a combination
of two basic logic gates namely, AND gate and NOT gate. It is
designed by connecting a NOT gate to the output line of the AND
gate, as shown in the following figure.

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.

Truth Table of NOR Gate

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.

Truth Table of XOR Gate


Input Output
Y = (AB' +
A B
A'B)
0 0 0
0 1 1
1 0 1
XNOR Gate
An XNOR gate is a type of derived logic gate which is a
combination of an XOR gate and a NOT gate. Hence, it produces
a "Noted XOR" output.

Logic Symbol of XNOR Gate

Truth Table of XNOR Gate


Input Output
A B Y
0 0 1
0 1 0
1 0 0
1 1 1
DeMorgan's Theorem

DeMorgan's First Theorem (Law 1)


DeMorgan's First Law states that the complement of a sum (ORing)
of variables is equal to the product (ANDing) of their individual
complements. In other words, the complement of two or more
ORed variables is equivalent to the AND of the complements of

⟮A+B⟯′=A′⋅B′
each of the individual variables, i.e.

DeMorgan's Second Theorem (Law 2)


DeMorgan's second law states that the complement of the product
(ANDing) of variables is equivalent to the sum (ORing) of their
individual complements.
In other words, the complement of two or more ANDed variables is
equal to the sum of the complement of each of the individual

⟮AB⟯′=A′+B′
variables, i.e.
S.No. SOP POS

1 SOP stands for Sum of POS stands for Product of Sums.


Products.
2 It is a technique of It is a technique of defining
defining the boolean terms boolean terms as a product of
as the sum of product sum terms.
terms.

3 It prefers minterms. It prefers maxterms.


4 In the case of SOP, the In the case of POS, the Maxterms
minterms are defined as are defined as ‘M’
‘m’.
5 It gives HIGH(1) output. It gives LOW(0) output.

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.

You might also like