4CS015

Lecture 3: Combinational Circuit

Prepared by: Uttam Acharya

 1. Lecture 3 coverage
Review of Week 2
• Boolean gates and logic
Mathematical functions in logic!
1. Lecture 2 Coverage • Understanding addition
• Making our own truth tables
• Building a circuit that can perform maths
• Reducing logic
 2. Circuit Design:

2. Circuit design
 Boolean Expression from Truth table
How do we derive Boolean Expression
from the given Truth Table??
Boolean Expression form
Truth Table

1. SUM OF PRODUCT
a. SOP Expression:
F = A’BC + AB’C + ABC’+ABC
2. PRODUCT OF SUM
a. POS Expression:
F = (A + B + C) (A + B + C ‘) (A + B’ + C) (A’ + B + C)
How do we know?? Well we will know that today.
4
 SOP Expression from Truth table
SUM OF PRODUCT
1. Scan for 1 in output variable (F)
SOP Expression form 2. Scan its corresponding input variable,
Truth Table
Here, A = 0 , B = 1 and C= 1
3. If input is “1” write the variable as it is and if the
variable is “0” then complement the variable. AND the
variable together.
The first expression is A’.B.C
4. Do likewise for all the remaining output then OR the
AND terms to obtain the output function.

F = A’BC + AB’C + ABC’+ABC

5
 SOP Expression from Truth table
PRODUCT OF SUM
1. Scan for 0 in output variable (F)
POS Expression form 2. Scan its corresponding input variable,
Truth Table
Here, A = 0 , B = 0 and C= 0
3. If input is “0” write the variable as it is and if the
variable is “1” then complement the variable. OR the
variable together.
The first expression is A+B+C
4. Do likewise for all the remaining output then AND the
Or terms to obtain the output function.

F = (A + B + C) (A + B + C ‘) (A + B’ + C) (A’ + B + C)

6
 2. Circuit Design (Contd.):
Three Steps starting from given circuit requirements in the form of

a table.
2. Circuit design
1. Formulate a Boolean expression for the output function from the

given table Using SOP or POS expression.

2. Simplify this expression as much as possible using Boolean

algebra.

3. Draw the circuit corresponding to the simplified output function.

7
 2. Circuit Design (Contd.):
2.1 Example:

We will design a circuit corresponding to the following

2. Circuit design
truth table. The output function is labelled X.

8
 2. Circuit Design (Contd.):
Step 1. First scan the output column for occurrences of 1. In this

example there are three (lines 1, 2 and 4).

2. Circuit design
For each of these lines construct a sub-expression involving A and

B and the operations AND (⋅) and NOT ( ͞ ) only that will return the

value 1 for the corresponding input values.

In row 1, A = 1 and B = 1 so A ⋅ B will return the value 1 for these

input values and for no others.

9
 2. Circuit Design (Contd.):
In row 2, A = 1 and B = 0 so A ⋅ B will return the required 1 for
these values
Finally, with A = 0 and B = 0, row 4 will require A ⋅ B
2. Circuit design
The three expression obtained are then combined together using OR
(+) operations. The final expression

10
 2. Circuit Design (Contd.):
Step 2: Simplify the Boolean Expression.

2. Circuit Design (Contd.):

11
 2. Circuit Design (Contd.):
Step 3: The circuit for the simplified output function X requires only two gates:

2. Circuit Design (Contd.):

Check that the truth table for X = A + B agrees with the original.

The method extends easily to three or more input pulses.

12
 2. Circuit Design (Contd.):
2.2 Another Example:
Design a Circuit corresponding to:

A B C X
1 1 1 1
2. Circuit Design (Contd.):
1 1 0 0
1 0 1 1
1 0 0 0
0 1 1 1
0 1 0 0
0 0 1 0
0 0 0 0 13
 2. Circuit Design (Contd.):
Step 1 There is a 1 in lines 1, 3 and 5 of the output column.

The sub-expressions which will return 1 in these lines are, respectively A ⋅ B ⋅

C, A ⋅ B ⋅ C and A ⋅ B ⋅ C
2. Circuit Design (Contd.):
The Boolean Expression is therefore given by

X = (A ⋅ B ⋅ C) + (A ⋅ B ⋅ C) + (A ⋅ B ⋅C)

14
2. Circuit Design (Contd.):
Step 2 : Simplify X = (A ⋅ B ⋅ C) + (A ⋅ B ⋅ C) + (A ⋅ B ⋅ C)

X = (A ⋅ B ⋅ C) + (A ⋅ B ⋅ C) + (A ⋅ B ⋅ C)
X = A.C (B + B ) + (A ⋅ B ⋅ C)
X = A.C .1 + (A ⋅ B ⋅ C) (Complement law)
X = A.C + (A ⋅ B ⋅ C)
X = C . ( A + A . B)
X = C . (A + B) (Distributive law)

The simplified Boolean Expression is therefore given by

X = C . (A + B)
2. Circuit Design (Contd.):
Step 3 The circuit for (A + B) ⋅ C is

16
3. Exercises ……
1.Design a Circuit corresponding to following truth tables:

A B C X A B C X
1 1 1 0 1 1 1 1
1 1 0 0 1 1 0 0
1 0 1 0 1 0 1 1
1 0 0 0 1 0 0 0
0 1 1 1 0 1 1 1
0 1 0 1 0 1 0 0
0 0 1 1 0 0 1 1
0 0 0 0 0 0 0 1
17
3. Exercises ……
Simplify and construct the logic circuit:

1.A’.B’ + (A.B)’

2.(A + B).(A + B) + A.(A + B’)

3.(A’. B + A.B’)’

4.((A + C).(AB)’ + (BC + A’)’)’

5.(A.B’.C’ + A’.B’.C+A.B.C+A’.B.C’)

18
4. Addition Rules as a Table
o Number 1 and Number 2 are the Inputs.
o Sum and Carry are the results after addition.

Number 1 Number 2 Result Carry Over

0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

19
5. Addition as Logical Functions
Input A Input B Sum Carry
Number 1 Number 2
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

• Assume that SUM is now a truth table Entry then:

• Doing the same for CARRY we get:

20
6. Half Adder
• Combinational logic circuits give us many useful devices.
• One of the simplest is the half adder, which finds the sum of
two bits.
• We can gain some insight as to the construction of a half
adder by looking at its truth table, shown at the right.

21
6. Half Adder

Input A Input B S (Sum) C (Carry)

0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
22
7. Full Adder Function

Input A Input B Carry IN Sum Carry OUT

0 0 0 0 0
1 0 0 1 0
0 1 0 1 0
1 1 0 0 1
0 0 1 1 0
1 0 1 0 1
0 1 1 0 1
1 1 1 1 1

23
7.1 Full Adder
• We could derive the full Boolean expression for the Sum and
Carry OUT.
• However, there is a great deal of symmetry associated with
the half and full adder and we can simply build a FULL from
two Halves.

24
7.2 Full Adder from Two Half Adders
• The Full Adder:

The Half
Adder

1 1 0
+ 1 1 1
1 1 0
carry:
1 1 0 1 25
7.3 Symbol for a Full Adder

A B Cin S Cou
t
0 0 0 0 0
1 0 0 1 0
0 1 0 1 0
1 1 0 0 1
0 0 1 1 0
1 0 1 0 1
0 1 1 0 1
1 1 1 1 1 26
8. Reduction.
If you develop the sum of products for the A B Cin S Cout
full adder.
0 0 0 0 0
Sum = ABC+ABC+ABC+ABC 1 0 0 1 0
0 1 0 1 0
Carry OUT = ABC+ABC+ABC+ABC 1 1 0 0 1
0 0 1 1 0
These show very little resemblance to 1 0 1 0 1
the circuits we are using. 0 1 1 0 1
1 1 1 1 1

By applying the laws and theorems of Boolean algebra we should be able to get
from the above to our circuits.

27
8.1 Reduction Basics
AND relationship OR relationship Theorem
0.X = 0 0+X = X (X+Y)(X+Y) = X
1.X = X 1+X = 1
X.X = X X+X = X because
X.X = 0 X+X = 1 (X+Y)(X+Y) = X.(Y+Y)

and Y+Y = 1
Not
and X.1 = X
X=X

28
8.2 Reduction
X.Y + X.Z
Y
As the outputs are same for
all inputs we can use this to
reduce XY+XZ
To X(Y+Z)
Z
X Absorption

X X.(Y+Z)
Z
29
8.2 Reduction
X X.Y + X.Y
Y
(X)

=Y
Y
Always on X

X
So X+X= 1
1 = always on

30
9. Carry: Sum of Products
Carry = ABC+ABC+ABC+ABC

Carry = ABC+ABC+ABC+ABC+ABC+ABC

AB(C+C)

BC(A+A) We have simply

applied Theorem 6
AC(B+B) 3 times.

Carry = A.B+B.C+A.C

31
10. Sum: sum of products
Sum = ABC+ABC+ABC+ABC
1. Sum =A(BC+BC)+A (BC+BC)
2. BC+BC = B C
3. BC+BC = B C
4. Substitute X for B C
5. We get AX + AX
6. A X
7 substitute B C=X
8. Sum = A (B C)
32
11. Summary

• We have looked at the basic logic gates:

• Identifying OR, AND, NOT, NAND, NOR and XOR.
• We have seen that gates can be joined together to form Combinatorial
Logic.

33
34