Logic Gates

Course Code: CSC 1101 Course Title: Introduction to Computer Studies

Dept. of Computer Science

Faculty of Science and Technology

Lecturer No: 09 Week No: 09 Semester:

Lecture Outline

 Understanding Logic Gate and the use of these.

Specific Objectives

 Logic gates

 Logic circuits and Boolean expressions

 Combinational circuits and design

Logic Gate

 Logic gates are electronic circuits that operate on one or more

input signals to produce standard output signal
 Are the building blocks of all the circuits in a computer

 Some of the most basic and useful logic gates are AND, OR, NOT,
NAND and NOR gates
AND Gate

• Physical realization of logical multiplication (AND) operation.

• Generates output signal of 1 only if all input signals are also 1
AND Gate (Block Diagram Symbol and
Truth Table)
OR Gate

 Physical realization of logical addition (OR)

operation
 Generates an output signal of 1 if at least one of
the input signals is also 1
OR Gate (Block Diagram Symbol and Truth
Table)
NOT Gate

 Physical realization of complementation operation

 Generates an output signal, which is the reverse of the
input signal
NOT Gate (Block Diagram Symbol and Truth
Table)
NAND Gate

 Complemented AND gate

 Generates an output signal of:

 1 if any one of the inputs is a 0

 0 when all the inputs are 1
NAND Gate (Block Diagram Symbol and
Truth Table)
NOR Gate

 Complemented OR gate
 Generates an output signal of:

 1 only when all inputs are 0

 0 if any one of inputs is a 1
NOR Gate (Block Diagram Symbol and Truth
Table)
 Logic Circuits

 When logic gates are interconnected to form a gating / logic

network, it is known as a combinational logic circuit
 The Boolean algebra expression for a given logic circuit can be
derived by systematically progressing from input to output on the
gates
 The three logic gates (AND, OR, and NOT) are logically complete
because any Boolean expression can be realized as a logic circuit
using only these three gates
Finding Boolean Expression of a Logic Circuit(Example 1)

A
A

NOT
D= AB +
B B+C AND
C
C OR
Finding Boolean Expression of a Logic Circuit(Example 2)

OR

A A
B
B
C=A

A B A AND
B +BAB

AND NOT
Constructing a Logic Circuit from a Boolean Expression
(Example 1)
Constructing a Logic Circuit from a Boolean Expression
(Example 2)
Universal NAND Gate

• Nand gate is an universal gate, I is alone sufficient to implement

any Boolean expression

 To understand this, consider:

 Basic logic gates (AND, OR, and NOT) are logically

complete
 Sufficient to show that AND, OR, and NOT gates can be
implemented with NAND gates
Implementation of NOT, AND and OR
Gates by NAND Gates

AA=A+A= A
A
(a) NOT gate implementation.

A B
A A B A
B
B (b) AND gate implementation.

(Continued on next slide)

Implementation of NOT, AND and OR Gates by
NAND Gates (Continued from previous
slide..)
and OR Gates
by

AA
A =A A B  A + B  A
B B B
B
=B
(c) OR gate implementation.
Method of Implementing a Boolean Expression with
Only NAND Gates

Step 1: From the given algebraic

expression, draw the logic diagram
both thewith AND, OR, and NOT inputs
gates.
(A) and complement (A)
normal Assume that are
available
Step 2: Draw a second logic diagram with the equivalent NAND
logic substituted for each AND, OR, and NOT gate

Step 3: all pairs of cascaded

Remove inverters from the
as
diagramfunction.
logical double inversion
Also remove does not to
connected
external performany and
single inverters the
corresponding input variable complement
inputs
Implementing a Boolean Expression with Only
NAND Gates (Example)

Boolean Expression =
A  B + C  A + B

A A D 
B A  B + C  A + B
B
B B D 
D A
D +BD

A C A
C
(a) Step 1: AND/OR implementation
+BD
(Continued on next slide)
Implementing a Boolean Expression with Only NAND Gates
(Example) (Continued from previous slide..)

AND
OR
A AB
1

5
B
AND OR
B
2 BD A+BD
3
D
A B +
A
C A+BD

AND

4
C
C A+B
(b) Step 2: Substituting equivalent NAND functions
D (Continued on next slide)
 Implementing a Boolean Expression with Only NAND Gates
(Example) (Continued from previous slide..)
(

A
1
B 5 A B + C  A
B 2
+BD
D 3
A
4
C

(c) Step NAND implementation.

3:
 Universal NOR Gate

 NOR gate is an universalgate, it is alone

sufficient to implement any Boolean expression
 To understand this, consider:
 Basic logic gates (AND, OR, and NOT) are
logically complete
 Sufficient to show that AND, OR, and NOT gates
can be implemented with NOR gates
Implementation of NOT, OR and AND Gates by
NOR Gates

AA=AA= A
A

(a) NOT gate implementation.

A A B A  BA 
B
B
(b) OR gate implementation.

(Continued on next slide)

Implementation of NOT, OR and AND Gates by NOR Gates
(Continued from previous slide..)

A A  A =A
A + B  A B  A
B

B
B  B =B
(c) AND gate implementation.
Method of Implementing a Boolean
Expression with Only NOR Gates

Step 1: For the given algebraic expression, draw the

logic
diagram with AND, OR, and NOT gates. Assume
both
available

that the normal A and complement A inputs are

Step 2:

Draw a second logic diagram with equivalent NOR logic
substituted for each AND, OR, and NOT gate

Step 3: Remove all parts of

cascaded inverters from
the diagram
logical function. as
Also remove double connected to
inversion
inverters single doesexternal
not performany
complemen
inputs the
and
corresponding input variable t
Implementing a Boolean Expression with Only NOR Gates
(Examples)(Continued from previous slide..)

Boolean Expression A B + C  A
=
+BD
A AB
B
A B + C A
B B
D A +BD
D +BD

A C A
C (a) Step 1: AND/OR implementation.
+BD
(Continued on next slide)
 AND
A

B OR
5 6

A  B + C A 
AND
+BD
B B
2
D
D OR
AN
D
A3
4

C C A

A +BD
+BD 
(b) Step Substituting equivalent NOR functions.
2:
(Continued on next slide)
Implementing a Boolean Expression with Only NOR Gates
(Examples)(Continued from previous slide..)

A 1

B 5 6 A B + C A +BD
B 2

D 3

4
A
C (c) Step NOR implementation.
3:
 Key Words/Phrases
 Absorption law  Equivalence function  NOT gate
 AND gate  Exclusive-OR function  Operator precedence
 Associative law  Exhaustive  OR gate
 Boolean algebra enumeration method  Parallel Binary Adder
 Boolean expression  Half-adder  Perfect induction
 Boolean functions  Idempotent law method
 Boolean identities  Involution law  Postulates of
 Canonical forms  Literal Boolean algebra
for Boolean  Logic circuits  Principle of duality
functions  Logic gates  Product-of-Sums
 Combination logic  Logical addition expression
circuits  Logical multiplication  Standard forms
 Cumulative law  Maxterms  Sum-of
 Complement of  Minimization of Products
a function Boolean functions expression
 Complementatio  Minterms  Truth table
n  NAND gate  Universal NAND
 De Morgan’s law gate
 Distributive law  Universal NOR
 Dual identities gate
References

 Computer Fundamentals: Pradeep K. Sinha & Priti Sinha

Thank you