UNIT :ii

LOGIC
GATES
BY
BHANUDAS NARWADE
ASST. PROF.
DEGLOOR COLLEGE,DEGLOOR
 LOGIC GATES:
Logic Gate: Is an electronic circuit and are the basic building blocks
of digital electronics.
It has one or more inputs and only one output.
Out put ( 0 or 1) depends on certain combinations of input

BASIC LOGIC GATES:

The basic logic gates are
NOT, AND and OR
DERIVED LOGIC GATES:
Derived logic gates are
NAND,NOR,X-OR X-NOR
Universal gates: NAND, NOR
BASIC GATES:
NOT GATE (INVERTER):
NOT also called Inverter
Used to complement or invert digital signal
To change one logic level to opposite
SYMBOL: TRUTH TABLE:
BASIC GATES:
AND GATE :
Logical multiplication
Two or more input and only one output
Boolean expression: Y=A.B
SYMBOL: TRUTH TABLE:

Y
BASIC GATES:
OR GATE :
Logical addition
Two or more input and only one output
Boolean expression: Y=A+B
UNIVERSAL GATES:
NAND GATE :
Universal gate due to versatile in nature
Two or more input and only one output
Boolean expression: Y=AB
UNIVERSAL GATES:
NOR GATE :
Universal gate due to versatile in nature
Two or more input and only one output
Boolean expression: Y=A+B
 X-OR GATE:
EXCLUSIVE-OR GATE :
Exclusive OR operation widely used in digital circuit
Two or more input and only one output
Can not be performed using basic gates
Boolean expression: Y=A B+A B
 EX-NOR GATE:
EXCLUSIVE-NOR GATE :
Exclusive NOR is complement of Ex-OR
Two or more input and only one output
Can not be performed using basic gates
Boolean expression: Y=A B+A B
 UNIVERSAL PROPERTIES OF NAND:

All digital logic can be performed by using NAND gate

1) NOT from NAND:
BY connecting both or all inputs of NAND together
For two input NAND Boolean expression is Y=A.A.=A

2) AND using NAND

Inverting the output of NAND gate AND
operation will be formed

Y=A.B =A.B
 UNIVERSAL PROPERTIES OF NAND:
3) OR Gate from NAND Gate:
Inputs are inverted before applied to another NAND gate
For two input NAND Boolean expression is

Y=A.B.=A+B =A+B

4) NOR using NAND

Out put of OR is inverted to get NOR

Y=A.B = A+B =A+B

 UNIVERSAL PROPERTIES OF NOR:
1) NOT Gate from NOR Gate:
Connecting all inputs of NOR gate
For two input NOR Boolean expression is

Y=A+A =A
2) AND using NOR
AND gate can be formed using NOR gate
with inverted inputs

Y=A+B = A.B =A.B

 UNIVERSAL PROPERTIES OF NOR:
3) OR Gate from NOR Gate:
Out put of NOR is inverted
For two input NOR Boolean expression is

Y=A+B =A+B
4) NAND using NOR

NAND gate can be formed using NOR

gate with expressions

Y=A+B = A.B =A.B

 LOGIC OPERATORS :

1) AND OPERATOR:
In Boolean algebra AND operator is denoted by( .) or no operator symbol at all
Similar to multiplication in ordinary algebra
For example A.B = Y
A B Y=A.B
2) OR OPERATOR:
0 0 0 Indicated by + sign
0 1 0 Similar to addition in ordinary algebra
1 0 0 For example A+B =Y A B Y=A+B
1 1 1
0 0 0
0 1 1
1 0 1
1 1 1
 LOGIC OPERATORS :

3) NOT OPERATOR:
Used for complement or inversion
Symbol is bar on over variable
For example A=A

A =A

A
A
0 1
1 0
 BOOLEAN ALGEBRA LAWS AND RULES :

1) AND LAWS: A A
0
Law 1 : A.0 =0 0

Law 2: A.1=A A
1 A
Law 3: A.A=A
A A

Law 4: A.A=0 A 0
A
 BOOLEAN ALGEBRA LAWS AND RULES :

1) OR LAWS: A
A
Law 5 : A+0 =A 0

Law 6: A+1=1 A
1 1
Law 7: A+A=A
A A

Law 8: A+A=1 A 1
A
 BOOLEAN ALGEBRA LAWS AND RULES :

Commutative Law: order of variables in OR and AND operation is

insignificant( allows change of position of variable)
Law 9 ( Commutative law of addition) :A+B=B+A

Law 10 (Commutative law of multiplication) :A . B=B . A

 BOOLEAN ALGEBRA LAWS AND RULES :
Associative Law: order of grouping in OR and AND operation is
insignificant( allows change of grouping)
 BOOLEAN ALGEBRA LAWS AND RULES :
Distributive Law: factoring or multiplying of different terms in an
expression is allowed.
Law 13 : A . (B + C) = AB + AC
Law 14 : A + (B . C) = ( A + B). ( A + C)
 DE-MORGAN’S THEOREMS :

Demorgan’s first Theorem:

Statement: Complement of sum is equal to the product of
complement
A+B = A.B
Proof:
 DE-MORGAN’S THEOREMS :

Demorgan’s Second Theorem:

Statement: Complement of product is equal to the sum of
complement
A.B = A +B
Proof:
SIMPLIFICATION OF BOOLEAN EXPRESSIONS:
SIMPLIFICATION OF BOOLEAN EXPRESSIONS:
SIMPLIFICATION OF BOOLEAN EXPRESSIONS:
SIMPLIFICATION OF BOOLEAN EXPRESSIONS:
 SUM –OF –PRODUCT FORM( SOP):

Product of two or more variables or their complements is AND

function of those variables
Product of two variable can be AB, for three variable ABC, so on
Sum in Boolean algebra is same as OR function
SOP expression is two or more AND fuctions OR ed together
For example AB + CD is SOP expression
AB+ BCD
ABC + DEF
ABC+DEFG+AEF
SOP can also contain a term with single variable
A+ BCD+ACD
SUM –OF –PRODUCT FORM( SOP):
Implement SOP expression using logic gates
 PRODUCT OF SUMS FORM ( POS):

POS expression is AND of two or more OR functions

For example (A + B ). ( C + D) is POS expression
( A+B). (B + C+ D)
( A +B+ C). ( D+ E+F)
SOP can also contain a term with single variable
A(B+C+D).(A+C+D)
 K-MAP (KARNAUGH MAPPING):

Karnaugh mapping (K-map) is another method for reduction in logical function.

Tool to perform systematic reduction of complex logical circuit into simplified
equivalent circuits.
Used to simplify equations having two , three, four , five, six different input
variables
Two variable map will require 22 =4 cells , a three variable map require 23=8
cells, 4 variable 24=16 cells (For N variables 2N cells required)
 K-MAP (KARNAUGH MAPPING):

Plotting a Boolean Expressions: SOP form of expression can be plotted on K map by

placing 1 in each cell corresponding to term of SOP
For example B
B B
A B +AB A
A 1
1

For three variables A B C + A B C + A B C + A B C

1 1 1
 K-MAP (KARNAUGH MAPPING):

Plotting a Boolean Expressions: SOP form of expression can be plotted on K map by

placing 1 in each cell corresponding to term of SOP
For example
A B +AB

For Four variables A B C D + A B C D + A B C D + A B C D

CD CD
AB CD CD CD
1 1
1 AB
11 11
AB
1
AB

AB
 K-MAP (KARNAUGH MAPPING):

Grouping cells for simplification: Group 1 s that are adjacent as per following rules
ഥ
1 Adjacent cells are cells differ by only a single variable for exam( A B C D and A B C𝐷
are adjacent)
2 The 1 s in adjacent cells must be combined in groups of 1 ,2, 4, 8, 16 and so on
3 Each group of 1 s should be maximized to include largest number of adjacent cells
4 Every 1 on map must be included in at least one group
5 There can be overlapping groups if they include noncommon 1 s
K-MAP (KARNAUGH MAPPING):
Grouping cells for simplification:
K-MAP (KARNAUGH MAPPING):
Grouping cells for simplification:
K-MAP (KARNAUGH MAPPING):
Simplifying the expression:
When all 1 s are grouped , the mapped expression is ready for simplification
1 Each group of 1 s creates a product term composed of all variables that
appears in only one form ( uncomplemented or complemented) within the
group
2 Variables that appear uncomplemented and complemented are eliminated
3 The final simplified expression is formed by summing the product terms
of all the groups
K-MAP (KARNAUGH MAPPING):
Simplifying the expression:
K-MAP (KARNAUGH MAPPING):
Simplifying the expression:

Using K map simplify the following expressions

ത + 𝐴𝐵ത 𝐶ҧ
A B 𝐶 + A𝐵𝐶

CD
AB 𝐶ҧ C

𝐴ҧ𝐵ത

ҧ
𝐴B AC
𝐴B 1

1 1
A𝐵ത
𝐴𝐵ത + 𝐴𝐶
𝐴𝐵ത
 HALF ADDER:
 Half adder adds two bit binary and produces sum and carry
 Two input ( A and B) and two outputs ( S=(SUM ) and C=CARRY)to half adder

From truth table, Sum bit is a 1 only when input variables are not equal.
The sum can be expressed as exclusive OR of the input variable
The output C is a 1 only when both A and B inputs are 1
Carry is expressed as AND of the input variables
 HALF ADDER:

 Logical expression:
 𝑆 = 𝐴ഥ 𝐵 + 𝐴𝐵ത = A  B
 C= A.B AB

A.B
 HALF ADDER:

 Half adder adds two bit binary and produces sum and carry
 FULL ADDER:
 Half adder adds three bit binary and produces sum and carry
 Three input ( A and B and Carry in) and two outputs ( S=(SUM ) and C=CARRY out)to
full adder
FULL ADDER:
FULL ADDER:
 SELF STUDY:

Simplify the expressions using K map

1) 𝑋 = 𝐴𝐵 ҧ 𝐶𝐷
ҧ + 𝐴𝐵ത 𝐶𝐷ҧ + 𝐴ҧ𝐵ത 𝐶𝐷
ҧ + 𝐴𝐵𝐶𝐷
ҧ + 𝐴𝐵𝐶ҧ 𝐷
ഥ + 𝐴𝐵𝐶𝐷
2) 𝑋 = 𝐵𝐶ҧ 𝐷ഥ + 𝐴𝐵ҧ 𝐶𝐷
ҧ + 𝐴𝐵𝐶𝐷 ҧ + 𝐴𝐵𝐶𝐷
ҧ + 𝐴𝐵𝐶𝐷 + 𝐴𝐵𝐶𝐷
 SOLUTION:
Simplify the expressions using K map
1) 𝑋 = 𝐴𝐵 ҧ 𝐶𝐷
ҧ + 𝐴𝐵ത 𝐶𝐷ҧ + 𝐴ҧ𝐵ത 𝐶𝐷
ҧ + 𝐴𝐵𝐶𝐷
ҧ + 𝐴𝐵𝐶ҧ 𝐷
ഥ + 𝐴𝐵𝐶𝐷

𝐶𝐷
𝐴𝐵
𝐶ҧ 𝐷
ഥ ҧ 𝐶𝐷
𝐶𝐷 ഥ
𝐶𝐷 ҧ
𝐶𝐷
1
𝐴ഥ 𝐵ഥ
ഥ𝑫 + 𝑨𝑩𝑫 + 𝑨𝑩𝑪
𝑿=𝑪 ഥ 𝐴ഥ 𝐵 1 𝐴𝐵𝐷
𝐴𝐵 1 1 1

𝐴𝐵ത
1
𝐴𝐵𝐶ҧ
SOLUTION:
Simplify the expressions using K map
𝑋 = 𝐵𝐶ҧ 𝐷
ഥ + 𝐴𝐵ҧ 𝐶𝐷ҧ + 𝐴𝐵𝐶𝐷 ҧ + 𝐴𝐵𝐶𝐷
ҧ + 𝐴𝐵𝐶𝐷 + 𝐴𝐵𝐶𝐷
𝑋 = (𝐴 + 𝐴). 𝐵𝐶ҧ 𝐷ഥ + 𝐴𝐵ҧ 𝐶𝐷ҧ + 𝐴𝐵𝐶𝐷 ҧ + 𝐴𝐵𝐶𝐷
ҧ + 𝐴𝐵𝐶𝐷 + 𝐴𝐵𝐶𝐷
𝑋 = 𝐴𝐵𝐶ҧ 𝐷ഥ + 𝐴𝐵ҧ 𝐶ҧ 𝐷 ҧ 𝐶𝐷
ഥ + 𝐴𝐵 ҧ + 𝐴𝐵𝐶𝐷ҧ + 𝐴𝐵𝐶𝐷
ҧ + 𝐴𝐵𝐶𝐷 + 𝐴𝐵𝐶𝐷

𝐶𝐷
𝐴𝐵
𝐶ҧ 𝐷
ഥ ҧ 𝐶𝐷
𝐶𝐷 ഥ
𝐶𝐷
B𝐷
𝐴ഥ 𝐵ഥ
𝑿 = B𝐶ҧ + 𝑩𝑫 𝐴ഥ 𝐵
1 1 1
𝐴𝐵
1 1 1
𝐴𝐵ത

B𝐶ҧ