Digital Logic Design

(EC 104)

Dr. Vivek Garg

Department of Electronics Engineering
S. V. National Institute of Technology (SVNIT)
Surat

email: vivekg@eced.svnit.ac.in; vivekgarg0101@gmail.com

 Course Outline

4/19/2023 2
 Course Outline

4/19/2023 3
 Course Text and Materials

4/19/2023 4
 Logic Operations and Logic Gates

• Basic building blocks of a digital circuit

• Data processing on the circuit is controlled using transistors
• Output depends on the logic gate and the input
• Input is one of two states – high or low
• Output is one of two states – high or low
• Two values the variables take may be called by different
names. (e.g., true and false, yes and no, etc.)
• Used to describe mathematically the manipulation and
processing of binary information.
• Consists of binary variables (A, B, C, y, z etc., ) and logical
operations.
• There are seven types of logic gates:
4/19/2023 Vivek Garg 5
 Logic Operations and Logic Gates

4/19/2023 Vivek Garg 6

 Logic Operations and Logic Gates

NOT Gate

• Represented by ʹ or by a bar.
ഥ
F = X’ or 𝑿
• Can be implemented by a single switch

4/19/2023 Vivek Garg 7

 Logic Operations and Logic Gates

AND gate

• Represented by ‘.’ or absence of an operator.

X.Y=Z or XY=Z
• Control 1: Enable, Control 0: Disable
• Can be considered as two switches connected in series

4/19/2023 Vivek Garg 8

 Logic Operations and Logic Gates

OR Gate

• Represented by ‘+’.
• Control 1: Disable, Control 0: Enable (Unused input)
• Can be considered as two switches connected in parallel.

4/19/2023 Vivek Garg 9

 Logic Operations and Logic Gates

4/19/2023 Vivek Garg 10

 Logic Operations and Logic Gates

Input-output signals for gates

4/19/2023 Vivek Garg 11

 Logic Operations and Logic Gates
NAND Gate

• Control 0 : Disable, Control 1: Enable

• Switching Circuit:

4/19/2023 Vivek Garg 12

 Logic Operations and Logic Gates
NOR Gate

• Control 1: Disable, Control 0 : Enable

• Switching Circuit:

4/19/2023 Vivek Garg 13

 Logic Operations and Logic Gates

XOR or Exclusive OR Gate

• When, x = y, o/p (F) is ‘0’: else ‘1’

• Control 0: Buffer, Control 1: Inverter
• x x = 0, x x’ = 1
• x 0 = x, x 1 = x’
• x x ……….. N = x , if N is odd, = 0, if N is even

4/19/2023 Vivek Garg 14

 Logic Operations and Logic Gates
XOR or Exclusive OR Gate

• Internal Diagram

4/19/2023 Vivek Garg 15

 Logic Operations and Logic Gates

XNOR or Exclusive NOR Gate

• When, x = y, o/p (F) is ‘1’: else ‘0’

• Control 0: Inverter, Control 1: Buffer
• x x = 1, x x’ = 0
• x 1 = x, x 0 = x’
• x x ……….. N = x , if N is odd, = 1, if N is even

4/19/2023 Vivek Garg 16

 Logic Operations and Logic Gates
XNOR or Exclusive NOR Gate

• Internal Diagram

4/19/2023 Vivek Garg 17

 Logic Operations and Logic Gates
Practice Problems
Q3
Q1

Q2 Q4

4/19/2023 Vivek Garg 18

 Logic Operations and Logic Gates

Boolean Algebra

• Mathematical system of binary logic is better known

as Boolean, or switching, algebra.
– conveniently used to describe the operation of
complex networks of digital circuits.
• Designers of digital systems use Boolean algebra
– to transform circuit diagrams to algebraic
expressions and vice versa.
• Mathematical notion used is Boolean Algebra.
• George Boole, 1854.

4/19/2023 Vivek Garg 19

 Logic Operations and Logic Gates
Boolean Algebra
1. (a) An identity element with respect to +, designated by 0:
x + 0 = 0 + x = x.
(b) An identity element with respect to •, designated by 1:
x • 1 = 1 • x = x.
2. (a) Commutative with respect to + : x + y = y + x.
(b) Commutative with respect to • : x y = y • x.

3. (a) • is distributive over + : x • (y + z) = (x • y) + (x • z).

(b) + is distributive over: x + (y • z) = (x + y) • (x + z).
4. For every element x ∈ B, there exists an element x′ ∈ B (called
the complement of x) such that: (a) x + x′= 1 and (b) x • x′ = 0.

4/19/2023 Vivek Garg 20

 Logic Operations and Logic Gates

Basic Postulates and Theorems

4/19/2023 Vivek Garg 21

 Logic Operations and Logic Gates

Operator Precedence

• (1) parentheses, (2) NOT, (3) AND, and (4) OR.

• (x + y)(x + z) = x + yz

• xy + x’z + yz = xy + x’z

4/19/2023 Vivek Garg 22

 Logic Operations and Logic Gates

Boolean Functions
• A Boolean function is an expression formed with
– binary variables
– the two binary operators OR and AND,
– the unary operator NOT,
– parentheses, and equal sign

• For a given value of the variables, the function can be either 0 or 1.

e.g.: F1 = xyz′
Boolean function represented as an algebraic expression.

4/19/2023 Vivek Garg 23

 Logic Operations and Logic Gates

Truth Table for Boolean function

F1 = xyz’

4/19/2023 Vivek Garg 24

 Logic Operations and Logic Gates

Truth Table for Boolean function

F1= x’y’z + x’yz + xy’

F2 = xy’+x’z

4/19/2023 Vivek Garg 25

 Logic Operations and Logic Gates

Examples

4/19/2023 Vivek Garg 26

 Logic Operations and Logic Gates

Implementation of Boolean function with gates

F1 = x+y’z

F2 = xyz’

F2= x’y’z + x’yz + xy’

F3 = xy’+x’z

4/19/2023 Vivek Garg 27

 Logic Operations and Logic Gates

Examples
Q1

Q2

Q3

Q4

Q5

4/19/2023 Vivek Garg 28

 Logic Operations and Logic Gates

Complement of a Function
• Complement of a function may be derived algebraically through
De Morgan’s theorem.
• De Morgan’s theorems can be extended to three or more
variables.
(A + B + C + D + … + F)′ = A′B′C′D′ … F′
(ABCD … F)′ = A′ + B′ + C′ + D′ + … + F′
• Complement of a function is obtained by interchanging AND
and OR operators and complementing each literal.
• Dual is used to convert positive logic to negative logic
• Self Dual concept

4/19/2023 Vivek Garg 29

 Logic Operations and Logic Gates

Examples: Compliment and Dual

• F1 = x′ y + x y′

• F2 = x′ yz′ + x′ y′ z

• F3 = x(y’z’ + yz)

4/19/2023 Vivek Garg 30

 Logic Operations and Logic Gates

Venn Diagram

4/19/2023 Vivek Garg 31

 Logic Operations and Logic Gates
Universal Gates

• NAND

• NOR

4/19/2023 Vivek Garg 32

 Logic Operations and Logic Gates

4/19/2023 Vivek Garg 33

 Logic Operations and Logic Gates

Sum of Product (SOP) and Product of Sum (POS) Form

4/19/2023 Vivek Garg 34

 Logic Operations and Logic Gates
Sum of Product (SOP) and Product of Sum (POS) Form

4/19/2023 Vivek Garg 35

 Logic Operations and Logic Gates

F = A + B’C

F = x + yz

4/19/2023 Vivek Garg 36

 Logic Operations and Logic Gates
Simplification of Boolean Functions

• Complexity of the digital logic gates that implement a Boolean

function
– directly related to the complexity of the algebraic expression
implemented.
• Simplification by algebraic means is awkward
– due to the lack of specific rules to predict succeeding steps.
• Map method provides
– straightforward procedure for minimizing Boolean functions
– Can be considered as pictorial form of a truth table or as an extension of
the Venn diagram
• First proposed by Veitch (1) and slightly modified by Karnaugh (2),
– known as the “Veitch diagram” or the “Karnaugh map.”

4/19/2023 Vivek Garg 37

 Logic Operations and Logic Gates

Karnaugh (K) Map

• Map is a diagram made up of squares.
– Each square represents one minterm.
– presents a visual diagram of all possible ways a function may
be expressed in a standard form.
• By recognizing various patterns,
– alternative algebraic expressions for the same function is
derived.
– Simplest expression is selected (with minimum literals- not
necessarily unique).

4/19/2023 Vivek Garg 38

 Logic Operations and Logic Gates
Simplification of Boolean Functions
K-Map

4/19/2023 Vivek Garg 39

 Logic Operations and Logic Gates

Simplification of Boolean Functions

K-Map

Fill the function Σm(0,1,3) in K- Map and simplify

B
A 1. Fill the 1s.
2. Form the largest rectangles of 1s
3. Check if any of the rectangles is
not required. (largest should be
selected)
4. Write the result.

Rectangle: Group of Squares of power 2, ie., 1, 2, 4, 8 etc.

4/19/2023 Vivek Garg 40

 Logic Operations and Logic Gates
Simplification of Boolean Functions

K-Map

F=A’B+AB’

4/19/2023 Vivek Garg 41

 Logic Operations and Logic Gates
Simplification of Boolean Functions

K-Map

4/19/2023 Vivek Garg 42

 Logic Operations and Logic Gates
Simplification of Boolean Functions

K-Map

4/19/2023 Vivek Garg 43

 Logic Operations and Logic Gates
Simplification of Boolean Functions

K-Map

Simplify Σm(0,1,2,3,4,5) using K- Map

Simplify Σm (0,2,4,5,6) using K- Map

4/19/2023 Vivek Garg 44

 Logic Operations and Logic Gates
Simplification of Boolean Functions

K-Map

4/19/2023 Vivek Garg 45

 Logic Operations and Logic Gates
Simplification of Boolean Functions

K-Map

4/19/2023 Vivek Garg 46

 Logic Operations and Logic Gates
Simplification of Boolean Functions

K-Map

Simplify Σm (0,1,2,4,5,6,8,9,10,12,13) using K- Map

4/19/2023 Vivek Garg 47

 Logic Operations and Logic Gates
Simplification of Boolean Functions
Don't care conditions

• Function is not specified in certain variable value combinations.

• The input combinations never occur (e.g. BCD)
• We do not care what the output is response to these inputs.
• Outputs are unspecified for the input combinations. Such functions are called
incompletely specified functions.
• Unspecified minterms of the function: don’t care conditions
• Used to provide further simplification of the functions.
• Marked with a ‘X’ and be used as adjacent term for simplification.

4/19/2023 Vivek Garg 48

 Logic Operations and Logic Gates
Simplification of Boolean Functions

4/19/2023 Vivek Garg 49

 Logic Operations and Logic Gates
Simplification of Boolean Functions

4/19/2023 Vivek Garg 50

 Logic Operations and Logic Gates
Simplification of Boolean Functions

4/19/2023 Vivek Garg 51

 Logic Operations and Logic Gates
Simplification of Boolean Functions

4/19/2023 Vivek Garg 52

 Logic Operations and Logic Gates

4/19/2023 Vivek Garg 53

 Logic Operations and Logic Gates
Simplification of Boolean Functions

4/19/2023 Vivek Garg 54

Quine-McClukey tabular method

4/19/2023 55
Quine-McClukey tabular method

4/19/2023 56
Quine-McClukey tabular method

4/19/2023 57
Quine-McClukey tabular method

4/19/2023 58
Quine-McClukey tabular method

4/19/2023 59
Quine-McClukey tabular method

4/19/2023 60
Quine-McClukey tabular method

4/19/2023 61
Quine-McClukey tabular method

4/19/2023 62
Quine-McClukey tabular method

4/19/2023 63
 Digital Logic Circuits

4/19/2023 64
Design Process

4/19/2023 65
4/19/2023 66
4/19/2023 67
4/19/2023 68
4/19/2023 69
 B = z(xy+x’y’) + x’y

4/19/2023 70
Binary to Gray and Gray to binary code convertor

4/19/2023 71
Comparator

4/19/2023 72
4/19/2023 73
4/19/2023 74
 Universal Gates
NAND Gate

4/19/2023 75
 Universal Gates
AND-OR to NAND

4/19/2023 76
 Universal Gates

4/19/2023 77
 Universal Gates

4/19/2023 78
 Universal Gates
NAND to AND-OR

4/19/2023 79
 Universal Gates
NOR Gate

4/19/2023 80
 Universal Gates
NOR to AND-OR

4/19/2023 81
 Universal Gates
XOR Gate

4/19/2023 82
Parity Generator

4/19/2023 83
Parity Checker

4/19/2023 84