21EE303: Digital System Design

Department of Electrical and Electronics Engineering

NMAM INSTITUTE OF TECHNOLOGY

(An Autonomous Institution affiliated to VTU, Belagavi)
Nitte – 574110, Karkala, Udupi District, Karnataka, India
1
 Unit 1
Combinational Logic Circuits

2
 LOGIC GATES
⚫ A logic gate is an elementary building block of a
digital circuit.

⚫ Logic gates can be created using transistor

technology, that perform Boolean operations on
high (5V) and low(0V) signals.
⚫ There are seven logic gates:
⚫ Basic gates: AND, OR and NOT

⚫ Universal gates: NOR and NAND

⚫ Other gates : XOR and XNOR

3
 AND GATE

For AND gate, if both the inputs are 1

the output is 1;otherwise, the output is 0.

4
 OR GATE
OR Gate: For OR gate, if both the inputs are 0 the output is 0;
otherwise, the output is 1.

5
 NOT GATE
NOT Gate: A NOT gate accepts one input signal (0 or 1) and
returns the complementary (opposite) signal as output.

6
 NAND GATE
NAND Gate: For NAND (“NOT of AND”) gate, if both the
inputs are 1, the output is 0; otherwise, the output is 1.

7
 NOR GATE
NOR Gate: The NOR (“NOT of OR”) gate, if both the
inputs are 0, the output is 1; otherwise, the output is 0.

8
 XOR GATE
XOR Gate: For XOR gate, if both the inputs are same,
the output is 0; otherwise, the output is 1.

9
 XNOR GATE
XNOR Gate: For XNOR gate, if both the inputs are
same, the output is 1; otherwise, the output is 0.

10
11
 PROPERTIES OF BOOLEAN
ALGEBRA

12
78
BASIC RULES OF BOOLEAN ALGEBRA

13
Proof For A+𝐴 B = A+B

A+𝐴B = A.1 + 𝐴 B
= A(1+B) + 𝐴 B
= A + AB + 𝐴 B
= A + B (A + 𝐴)
14
Proof For (A+B)(A+C) = A+BC

(A+B)(A+C) = A.A + A.C + B.A + B.C

= A + A.C + B.A + BC
= A(1+C)+ BA +BC
= A + BA + BC
= A(1+B) + BC
= A +BC

15
DeMorgan’s Theorems
(i)
(ii)

16
1. Simplify the boolean expression
and realize using basic gates.

17
 Write the boolean expression for the given logic diagram

18
85
AND-OR-INVERTER

19
Definition of Combinational Circuit
• Combinational Circuit deals with the
techniques of “combining” the basic gates into
circuits that performs some desired function.
• Examples – Adders, Subtractors, Decoders.
Encoders, Multipliers etc
• Logic circuits without feedback from output to
input.
• Logic circuits that contain no memory
20
 Boolean Equations

• Also known as Switching equations

• A literal is a Boolean Variable or its complement (a, x’, z)
• A product term is a literal or the logical product (AND)
of multiple literals (ab, x’y, z’y’)
• A sum term is a literal or the logical sum (OR) of
multiple literals (a+b, a’+b, x’+y’)
• A sum of product (SOP) is the logical OR of multiple
product terms (ab+bc’+a’b’)
• A product of sum (POS) is the logical AND of multiple
sum terms[(a+b’)(a’+b’)(a’+b)]

21
 Minterms
• A minterm is a special product of literals, in which each
input variable appears exactly once.
• A function with n variables has 2n minterms
• Each minterm is true for exactly one combination of
inputs
Minterm Is true when.. Shorthand
x’y’z’ x=0, y=0, z=0 m0
x’y’z x=0, y=0, z=1 m1
x’yz’ x=0, y=1, z=0 m2
x’yz x=0, y=1, z=1 m3
xy’z’ x=1, y=0, z=0 m4
xy’z x=1, y=0, z=1 m5
xyz’ x=1, y=1, z=0 m6
xyz x=1, y=1, z=1 m7
22
 Sum of Minterms

• Sum of minterms expression can be written

from the truth table by picking out the rows of
the table where the function output is 1.
x y z f(x,y,z) f’(x,y,z) f = x’y’z’ + x’y’z + x’yz’ + x’yz + xyz’
0 0 0 1 0 = m 0 + m1 + m 2 + m3 + m6
0 0 1 1 0 = m(0,1,2,3,6)
0 1 0 1 0
0 1 1 1 0 f’ = xy’z’ + xy’z + xyz
1 0 0 0 1 = m 4 + m5 + m 7
1 0 1 0 1 = m(4,5,7)
1 1 0 1 0
1 1 1 0 1
f’ contains all the minterms not in f

23
 Maxterms
• A maxterm is a special sum of literals, in which each
input variable appears exactly once.
• A function with n variables has 2n maxterms
• Each maxterm is false for exactly one combination of
inputs
Maxterm Is false when… Shorthand
x+y+z x=0, y=0, z=0 M0
x + y + z’ x=0, y=0, z=1 M1
x + y’ + z x=0, y=1, z=0 M2
x + y’ + z’ x=0, y=1, z=1 M3
x’ + y + z x=1, y=0, z=0 M4
x’ + y + z’ x=1, y=0, z=1 M5
x’ + y’ + z x=1, y=1, z=0 M6
x’ + y’ + z’ x=1, y=1, z=1 M7
24
 Product of Maxterms
• Product of maxterms expression can be by
picking out the rows of the table where the
function output is 0.
x y z f(x,y,z) f’(x,y,z) f = (x’ + y + z)(x’ + y + z’)(x’ + y’ + z’)
0 0 0 1 0 = M4 M5 M7
0 0 1 1 0 = M(4,5,7)
0 1 0 1 0
f’ = (x + y + z)(x + y + z’)(x + y’ + z)
0 1 1 1 0 (x + y’ + z’)(x’ + y’ + z)
1 0 0 0 1 = M0 M1 M2 M3 M6
1 0 1 0 1 = M(0,1,2,3,6)
1 1 0 1 0
1 1 1 0 1 f’ contains all the maxterms not in f

25
 Relation of Minterm to Maxterm

• Any minterm mi is the complement of the

corresponding maxterm Mi
Minterm Shorthand Maxterm Shorthand
x’y’z’ m0 x+y+z M0
x’y’z m1 x + y + z’ M1
x’yz’ m2 x + y’ + z M2
x’yz m3 x + y’ + z M3
xy’z’ m4 x’ + y + z M4
xy’z m5 x’ + y + z’ M5
xyz’ m6 x’ + y’ + z M6
xyz m7 x’ + y’ + z’ M7

26
Karnaugh Maps
41
42
45
46
47
Simplify the following using Karnaugh
Maps
1. Q=f(a,b,c)= (1,2,3,6,7)
2. L=f(a,b,c,d)= (0,2,5,7,8,10,13,15)
Prime Implicants and Essential Prime
Implicants

Minimal Sum = x’z’+ yz

49
Minimal Sum = z’
50
Find the PI and EPI. Also find the
minimal SUM

51
52
Minimal sum obtained

53
 Find the PIs and EPIs for the following expression
and find the minimal sum

22-11-2022 57
 Find the PIs and EPIs for the following expression and find the
minimal sum

22-11-2022 58
• Find the PIs and EPIs for the following and find the
minimal sum f(w,x,y,z) = ∑(5,7,8,9,13)

22-11-2022 59
• Find the PIs and EPIs for the following and find the
minimal sum

22-11-2022 60
 Find the PIs and EPIs for the following and find the minimal sum

22-11-2022 61
 Find the minimal Sum expression for the following

22-11-2022 62
 Find the minimal Sum expression for the following

22-11-2022 63
 Find the minimal Sum expression for the following

22-11-2022 64
 Find the minimal Sum expression for the following

22-11-2022 65
 Find the minimal Sum expression for the following

22-11-2022 66
Show the grouping of Maxterms. Mention Prime Implicates
and Essential prime implicates. Also Find the Minimal
Product .

J = f (x,y,z) = ∏ (0,3,4,7)

67
Minimal Product

68
Show the grouping of Maxterms. Mention Prime Implicates and
Essential prime implicates. Also Find the Minimal Product
f(w,x,y,z)= ∏M(0,2,3,5,7)

Minimal Product f= (x+z)(y’+z’)(x’+z’)

69
70
71
Minimal Product
72
Show the grouping of Maxterms. Mention Prime Implicates
and Essential prime implicates. Also Find the Minimal Product

Y=f(a,b,c,d)=

78
Show the grouping of Maxterms. Mention Prime Implicates
and Essential prime implicates. Also Find the Minimal Product

Y=f(a,b,c,d)=

All are EPIs since there are unique 0 in each group

79
Mention Prime Implicants, Essential prime implicants and Find the Minimal
Sum. For the same function find Prime Implicates, Essential prime implicates and
Find the Minimal product
• f(a,b,c,d)= ∏M(0,1,4,5,8,9,11)+dc(2,10)
Ans1: PI are bc,cd’ and EPI are ab,ca’ Ans2: PI are, b+c,b+d EPIs are a+c, a’+b

Show the grouping of Maxterms and find the Minimal Product using K maps for
the following function.
• f(a,b,c,d)= ∏(1,2,3,4,9,10)+dc(0,14,15)
• Ans : (a+b)(a+c+d)(b+c+d’)(a’+c’+d) or (a+b)(a+c+d)(b+c+d’)(b+c’+d)

Find the minimal sum and minimal product for the following incompletely
specified function
• f(a,b,c,d)= ∑m(6,7,9,10,13)+dc(1,4,5,11,15)
• Ans: Minimal sum= a’b+ab’c+ad or a’b+ ab’c+ad; minimal product =
(a+b)(c+d)(a’+b’+d)

Find the Minimal Product for the following functions

• f(a,b,c)= ∏M(1,2,5,6,7)
• f(x,y,z)= ∏(0,3,4,7)
 MAP ENTERED VARIABLE METHOD

MAP ENTERED VARIABLE OR MEV METHOD

For the Given Boolean Function determine the minimal sum and minimal product using
MEV by taking a,b as input variables in K-map f(a,b,c,d)=∑(2,3,4,5,13,15)+dc(8,9,10,11)
Verilog (to be continued)