Chapter- 3 Combinational Digital Circuit(Part-1)

Prepared by: Krupa Patel

9/13/2023
 Types of Digital Circuit
There are two types of digital circuit
1. Combinational logic circuits.
2. Sequential logic circuits.

Combinational Circuits: The output of a Combinational Circuit depends entirely on the

present input.
Example of Combinational circuit: 1. Adder , Subtractor
2. Comparator
3. Encoder , Decoder
4. Multiplexer , Demultiplexer
9/13/2023
9/13/2023
 Design of Combinational Circuit
The methods used for simplifying the Boolean function are as follow:
1. Algebraic method.
2. Karnaugh map(K-map)Simplification.
3. Quine-Mc Cluskey method.
4. Variable Entered Mapping (VEM)technique.

Will discuss K-map and Quine-Mc Cluskey method.

Any Logical expression can expressed in following two standard form:

1. Sum of Product(SOP)
2. Product of Sum(POS)

9/13/2023
SUM OF PRODUCTS
PRODUCT OF SUMS

9/13/2023
SOP FORM:

9/13/2023
POS FORM:

9/13/2023
Standard SOP , POS form and Canonical Form
The canonical forms are the special form of SOP and POS forms .
Which is known as standard SOP and Standard POS form.

In SOP and POS form, all individual terms do not involved all
literals.

9/13/2023
Canonical Form

9/13/2023
 Concepts of Min terms and Max terms
Min term:
Each individual term in the standard SOP form is called as min term

Max term:
Each individual term in the standard POS form is called as min term

9/13/2023
1 Conversion from Non standard SOP to Standard SOP
form
Step-1: Find Missing Literal for each term
Step-2:AND each term with(missing literal + it’s complement)
Step-3: Simplify the expression to get the standard SOP

9/13/2023
Convert in standard SOP FORM

Y=A+BC+ABC
Y=AB+AC´+BC
Convert F(A,B,C)=BC+A into standard
minterm form.

SOP FORM

9/13/2023
2 Conversion from Non standard POS to Standard POS form
Step-1: Find Missing Literal for each term
Step-2: OR each term with(missing literal * it’s complement)
Step-3: Simplify the expression to get the standard POS

9/13/2023
Convert in standard POS FORM

Y=(A+B).(A+C).(B+C’)
Y= =(A+B)(B’+C)
Express the Boolean function
F=AB+A’C In a product of maxterm.

9/13/2023
 POS

SOP

9/13/2023
Writing SOP and POS Forms form truth table

9/13/2023
 Methods to simplify the Boolean Function

1. Algebric Method

Y=∑m(2,4,6) ………………..ans: C’(A+B)

Y=∏M(1,3,5)………………..ans: AB+C’

9/13/2023
 2. K-MAP(Karnaugh - Map)

Another simplification technique to reduce the

Boolean equation.
It is graphical method of simplification technique.
The K-map can be used for systematic
simplification of Boolean expression.

9/13/2023
Two Variable K Map-

Two variable K Map is drawn for a Boolean expression consisting of two variables.
The number of cells present in two variable K Map = 22 = 4 cells.
So, for a Boolean function consisting of two variables, we draw a 2 x 2 K Map.

9/13/2023
Three Variable K Map-

Three variable K Map is drawn for a Boolean expression consisting of three variables.
The number of cells present in three variable K Map = 23 = 8 cells.
So, for a Boolean function consisting of three variables, we draw a 2 x 4 K Map.

9/13/2023
Four Variable K Map-

Four variable K Map is drawn for a Boolean expression consisting of four variables.
The number of cells present in four variable K Map = 24 = 16 cells.
So, for a Boolean function consisting of four variables, we draw a 4 x 4 K Map.

9/13/2023
Karnaugh Map Simplification Rules-
To minimize the given Boolean function,
We draw a K Map according to the number of variables it contains.
We fill the K Map with 0’s and 1’s according to its function.
Then, we minimize the function in accordance with the following rules.

Rule-01:
We can either group 0’s with 0’s or 1’s with 1’s but we can not group 0’s and 1’s
together.
X representing don’t care can be grouped with 0’s as well as 1’s.

Rule-02:
Groups may overlap each other.

9/13/2023
Rule-03:
We can only create a group whose number of cells can be represented in the power of 2.
In other words, a group can only contain 2n i.e. 1, 2, 4, 8, 16 and so on number of cells.

Example-

Rule-04:
Groups can be only either horizontal or vertical.
We can not create groups of diagonal or any other shape.

9/13/2023
 Rule-05:

Each group should be as large as possible.

Rule-06:

Opposite grouping and corner grouping are allowed.

The example of opposite grouping is shown illustrated in Rule-05.

Rule-07:
9/13/2023
•There should be as few groups as possible.
Problem-01:
Minimize the following boolean function-
F(A, B, C, D) = Σm(0, 1, 2, 5, 7, 8, 9, 10, 13, 15)

Solution- SOP

Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map.

We fill the cells of K Map in accordance with the given boolean function.
Then, we form the groups in accordance with the above rules.

Then, we have-

F(A, B, C, D)
= (A’B + AB)(C’D + CD) + (A’B’ + A’B + AB +
AB’)C’D + (A’B’ + AB’)(C’D’ + CD’)
= BD + C’D + B’D’

Thus, minimized boolean expression is- 9/13/2023

F(A, B, C, D) = BD + C’D + B’D’

 Problem-02:

Minimize the following Boolean function-

F(A, B, C, D) = Σm(0, 1, 3, 5, 7, 8, 9, 11, 13, 15)

= (A’B’ + A’B + AB + AB’)(C’D + CD) + (A’B’ + AB’)(C’D’ + C’D)

= D + B’C’

Thus, minimized boolean expression is-

F(A, B, C, D) = B’C’ + D

9/13/2023
SELF PRACTICE(Minimization Of SOP expression)

Y=A’B’C’+A’BC’+A’BC+AB’C ∑m(0,2,3,5) ans: Y=A’B+A’C’+AB’C

Y= ∑m(0,1,2,5,13,15) ans: Y=A’B’D’+A’C’D+ABD
Y= ∑m(1,5,7,9,11,13,15) ans: Y=C’D+BD+AD
Y= ∑m(1,3,5,9,11,13) ans: Y=D(B’+C’)
Y= ∑m(1,3,4,5,7,9,11,13,15) ans: Y=D+A’BC’
Y= ∑m(1,2,9,10,11,14,15) ans: Y=B’(C’D+CD’)+AC

NOTE: Also draw Realization in all

PARING OF 1 9/13/2023
 Don’t care condition
For SOP Form we enter 1’s corresponding to the
combination of input variables which produce high output
enters 0’s in the remaining cells of the K-map.

For POS Form we enter 0’s corresponding to the

combination of input variables which produce low output
enters 1’s in the remaining cells of the K-map.
9/13/2023
 Don’t care condition
Examples:
Y= ∑m(1,3,7,11,15)+d(0,2,5)
Y= ∑m(2,4,6,11,12,14)+d(3,10)

9/13/2023
 POS SIMPLIFICATION
K-MAP OF 3 K-MAP OF 4 VARIABLE
VARIABLE

9/13/2023
SELF PRACTICE(Minimization Of POS expression)

Y=∏M(0,1,2,3,5,7) ans: AC’

Y=∏M(0,4,5,7,10,11,14,15) ans: (A’+C’)(A+B’+D’)(A+C+D)
Y=∏M(0,1,2,4,6) ans: (A+B)C

PAIRING OF 0
9/13/2023
 Disadvantage of K-MAP

1. It is manual technique. We can not use computer for K-MAP

solution.
2. Extremely complicated if number of variable is more than 6.
3.The process is depends on the skills and ability of the user.

9/13/2023
 MC-Cluskey Method(Tabular method)

y(A,B,C,D)= ∑m(0,1,3,7,8,9,11,15) .........ANS:B’C’+CD

y(A,B,C,D)=∑m(0,1,2,3,5,7,8,9,11,14)…...Ans:ABCD+A’B’+
B’C’+A’D+B’D

9/13/2023
1. Description with Block diagram and truth table.
2. K-map
3. Circuit diagram or Realization
4. Advantage, Disadvantage, Application

9/13/2023
9/13/2023
9/13/2023
9/13/2023
9/13/2023
9/13/2023
1

9/13/2023
9/13/2023
9/13/2023
 Full Subtractor
Full Subtractor is two input and two output Combinational circuit

9/13/2023
K-map for Difference
K-map for Borrow

9/13/2023