1. PRESENTED BY
SWARNIKA KUMARI, LECTURER
DEPARTMENT OF ELECTRONICS ENGINEERING
GOVERNMENT POLYTECHNIC SIWAN
Combinational Logic Circuits
2. CONTENT
Introduction
Difference between Combinational & Sequential
Classification of Combinational Logic Circuits
Half Adder
Full Adder
Application
3. SESSION OUTCOMES
After attending this session, the student will be
able to:
•Students will be able to distinguish between combinational and sequential circuits.
•Students will design and analyze half adders and full adders.
•Students will understand the significance of combinational circuits in practical
applications.
4. Introduction
A combinational logic circuit is a type of digital
circuit in which the output is determined solely by
the current combination of inputs, without any
dependence on previous inputs or states.
These circuits perform operations based on
Boolean algebra and are used for various
applications, such as arithmetic operations, data
processing, and signal manipulation.
7. Half Adder
Adding two single-bit binary values, X, Y produces a
sum S bit and a carry out C-out bit.
This operation is called half addition and the
circuit to realize it is called a half adder.
Half Adder Truth Table
Inputs
Outputs
X Y S C-out
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
S(X,Y) = (1,2)
S = X’Y + XY’
S = X Y
C-out(x, y) = (3)
C-out = XY
Half
Adder
X
Y
S
C-out
9. Full Adder
Full Adder Truth Table
Inputs Outputs
X Y C-in S C-out
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
Full
Adder
S
X Y
C-in C-out
Adding two single bit binary values X & Y with a Carry input bit
produces a sum bit and carry output bit
S(X,Y, C-in) = (1,2,4,7)
C-out(x, y, C-in) = (3,5,6,7)
S = X’Y’(C-in) + XY’(C-in)’ + XY’(C-in)’ + XY(C-in)
S = X Y (C-in)
11. Application
1.Arithmetic Logic Units (ALUs)
2.Data Transmission Systems
3.Memory Address Decoding
4.Display Systems
5.Digital Signal Processing (DSP)
6.Automation Systems
7.Error Detection and Correction