Principle of Digital
Technique
Chapter :-2
Logic Gate
Introduction
A logic gate is an elementary
building block of a digital circuit.
Most logic gates have two inputs
and one output.
At any given moment, every
terminal is in one of the two binary
conditions low (0) or high (1),
represented by different voltage
levels.
There are seven basic logic gates:
AND,
OR,
XOR,
NOT,
NAND,
NOR,
XNOR.
AND GATE
A
Y=Ax
B
B
Symbol
Truth
Table
Input 1(A) Input 2(B) Output(Y)
0 0 0
0 1 0
1 0 0
1 1 1
OR GATE
A
B
Y=A+B
Symbol
Truth Table
Input 1(A) Input 2(B) Output(Y)
0 0 0
0 1 1
1 0 1
1 1 1
EX-OR GATE
A
B Y=AB+AB
Symbol
Truth
Input 1(A) Table
Input 2(B) Output(Y)
0 0 0
0 1 1
1 0 1
1 1 0
NOT GATE
A Y=Ấ
Symbol
Truth
Table
Input 1(A) Output(Y)
0 1
1 0
NAND GATE
A
B
Y=AB
Symbol
Truth
Table
Input 1(A) Input 2(B) Output(Y)
0 0 1
0 1 1
1 0 1
1 1 0
NOR GATE
A
B Y=A+B
Symbol
Truth
Table
Input 1(A) Input 2(B) Output(Y)
0 0 1
0 1 0
1 0 0
1 1 0
EX-NOR GATE
A
Y=AB+A
B
B
Symbol
Truth
Table
Input 1(A) Input 2(B) Output(Y)
0 0 1
0 1 0
1 0 0
1 1 1
Summary
Using combinations of logic gates,
complex operations can be
performed.
In theory, there is no limit to the
number of gates that can be arrayed
together in a single device. But in
practice, there is a limit to the number
of gates that can be packed into a
given physical space.
Arrays of logic gates are found in
digital integrated circuits (ICs).
Boolean Laws
There are six laws of Boolean
Algebra.
Commutative law
Distributive law
Associative law
AND law
OR law
INVERSION Law
Distributive
law
The distributive law states
that,
A.(B+C)=A.B+A.C
Commutative law
Statement: “Any binary operation which satisfies
the following expression is referred to as
commutative operation.”
A x B = B x A
A + B = B + A
Associative law
This law states that the order in which the logic
operations are performed is irrelevant as their effect is
the same.
(A.B).C=A.(B.C)
(A+B)+C=A+(B+C)
OR law
A+0=A
A+1=1
A+A=A
A+A=1
AND law
A x 0=0
A x 1=A
A x A=A
A x A=0
INVERSION Law
This law uses the “NOT” [Link] inversion law
states that doble inversion of a variable results in the
original variable itself
A=A
De-morgans law
Theorem 1:This theorem states that the ,
complement of a product is equal to addition
of the complements.
AB=A+B
Theorem 2:This theorem states that the ,
complement of a sum is equal to Product of
the complements.
A+B=A x B
Proof:-Theorem1
1 2 3 4 5 6 7
A B AB AB A B A+
B
0 0 0 1 1 1 1
0 1 0 1 1 0 1
1 0 0 1 0 1 1
1 1 1 0 0 0 0
Column no 4 & 7 are identical
hence De-morgans theorem is
proved