BACSE103
Computation Structures
Module 1 – Digital Systems and Combinational
Circuits
Dr. Banupriya
Assistant Professor
School of Computer Science and Engineering
Vellore Institute of Technology, Vellore
Lab Experiments
2
Lab Experiments
3
Lab Experiments
4
Combinational Circuits
Combinational Circuits
• Combinational and sequential circuits are types of digital circuits
• It differs from each other in terms of output generation techniques.
Combinational Circuits
Difference between Sequential and combinational Circuits
BASIS FOR
COMBINATIONAL CIRCUIT SEQUENTIAL CIRCUIT
COMPARISON
Basic The output is discovered by the Both the present input and past state
present state of the inputs. output are used to identify the output.
Storage capability Does not store data. Can store a small amount of data.
Application Used in adders, encoders, Flip-flop and latches.
multiplexer, etc
Clock Circuits do not rely on the clock. Clock is utilized for performing
triggering functions.
Feedback No requirement of the feedback. Feedback is required.
Full Adder
Combinational Circuits-Full Adder
• Adding two single-bit binary values, X, Y with a carry input bit C-in produces a sum bit S and a
carry out C-out bit.
For Sum
Value
Combinational Circuits-Full Adder
• Adding two single-bit binary values, X, Y with a carry input bit C-in produces a sum bit S and a
carry out C-out bit.
For Carry
Value
CB,AB,AC------- While grouping 1’s taking row as it is and
write the common value along column wise
Combinational Circuits-Full Adder
Implementation of Full Adder
Full Subtractor
Combinational Circuits- Full Subtractor
Combinational Circuits- Full Subtractor
A B Bin D (Difference) Bout (Borrow-out) Explanation
0 0 0 0 0 0 - 0 - 0 = 0, no borrow needed
0 0 1 0 - 0 - 1 = -1 → borrow needed →
1 1
result = 1 with borrow
0 1 0 0 - 1 - 0 = -1 → borrow needed →
1 1
result = 1 with borrow
0 1 1 0 - 1 - 1 = -2 → borrow needed →
0 1
result = 0 with borrow
1 0 0 1 0 1 - 0 - 0 = 1, no borrow needed
1 0 1 0 0 1 - 0 - 1 = 0, no borrow needed
1 1 0 0 0 1 - 1 - 0 = 0, no borrow needed
1 1 1 1 - 1 - 1 = -1 → borrow needed →
1 1
result = 1 with borrow
Combinational Circuits- Full Subtractor
Combinational Circuits- Full Subtractor
Combinational Circuits- Full Subtractor
Binary Parallel Adder
Binary Parallel Adder
• A parallel adder adds two binary numbers that have more than one bit (like 4-bit or 8-bit numbers).
• It adds all pairs of bits at the same time (in parallel) instead of one after another.
• It is made by connecting many full adders in a row (chain).
• Each full adder handles one pair of bits from the two numbers.
• The carry output from one full adder goes into the carry input of the next full adder on the left
(higher bit).
• For an n-bit number, you need n full adders connected in this way. This design helps add large
binary numbers faster than adding bits one by one.
2 Bit- Binary Parallel Adder
• A two-bit adder is a circuit the adds together two,
2-bit numbers.
• The first number, A, can be representing using bits
a1 and a0. The second number, B, is similarly
represented as b1 and b0
2 Bit- Binary Parallel Adder
Circuit Diagram of 2 bit binary parallel Adder
3 and 4 Bit- Binary Parallel Adder
• Binary parallel adder is also called as ripple adder
• Any multi-bit binary adder that uses a series of full adders connected by carry lines is a ripple carry adder
Thank you
