DE LA SALLE UNIVERSITY-DASMARIÑAS

COLLEGE OF ENGINEERING, ARCHITECTURE, AND TECHNOLOGY

ENGINEERING DEPARTMENT
COMPUTER ENGINEERING PROGRAM

COMPUTER ORGANIZATION AND ARCHITECTURE

(T-CPET326LA)

Enabling Assessment 3:
Design of 4-bit Carry Ripple Adder

Grade

Submitted By:
Sarmiento, Iverson M.

Submitted To:

Engr. Michael C. Olivo

Professor
Prayer:

Thank you God for all the things you've made our world to be.
For every single living plant, insect, bird and tree.

Thank you God for all the people you have placed around us.
For every single parent, friend and teacher that we trust.

Thank you Lord for all the gifts you send to us each day.
For every single meal and snack, for cuddles, toys and play.

Thank you God for caring for us, we know you always see,
Our every need, our worries, cares, our laughter, joys and tears.

Thank you Lord that you're our friend, you delight in all we do,
Especially when you hear our prayers, and we give thanks to you.

Amen.

Learning Outcome

TLO1. Demonstrates 4-bit Carry Ripple Adder circuit.

TLO2. Design 4-bit Carry Ripple Adder circuit using simulation software.

Discussion:

4-bit Carry Ripple Adder

Assume you want to add two operands A and B where

A= A3 A2 A1 A0

B=B3 B2 B1 B0

For example: A= 1 0 1 1 +

B= 1 1 0 1

---------------

A+B= 11 0 0 0 = C out S3 S2 S1 S0
 From the example above it can be seen that we are adding 3 bits at atime sequentially until

all bits are added. A full adder is a combinational circuit that performs the arithmetic sum of

three input bits: augends Ai, addend Bi and carry in Cin from the previous adder. Its results

contain the sum Si and the carry out,Cout to the next stage.

Fig. 1 4_bit adder

So to design a 4-bit adder circuit we start by designing the 1 –bit full adder then connecting the

four 1-bit full adders to get the 4-bit adder as shown in the diagram above. For the 1-bit full

adder, the design begins by drawing the Truth Table for the three input and the corresponding

output SUM and CARRY. The Boolean Expression describing the binary adder circuit is then

deduced. The binary full adder is a three input combinational circuit which satisfies the truth

table below.
 Fig.2. Diagram and Truth Table of Full Adder

The Boolean equations of a full adder are given by:

Sout = ABC + AB’C’ + A’B’C + BA’C’

=(AB’+BA’)C +AB+A’B’) C’
Sout = A⊕B⊕C Cout =
AB + AC + BC

Cout = AB + C (A⊕B)

The circuit diagram is shown in Fig.3 and the simulation results is shown in Fig. 4

Fig. 3. The Gate level Diagram of Full Adder

 Fig. 4 1 bit full adder simulation results

To design a 4-bit adder now we cascade 4 1-bit adders as shown in Fig. 5

Fig. 5 4-bit Ripple Carry adder

As is seen from Fig. 5 and Fig. 6 the carry ripples through the 4 full adders to appear at the
output, while the sums are available after 2 XOR delay.

B A B A B A B A

Cou C F C F C
F F Ci

S S S S
Fig. 5 Carry Propagation

The carry propagation is shown in Fig. 5 as a block and as a path through the circuit in Fig. 6

Fig. 6 carry propagation through the circuit

OBSERVATIONS/RESULTS:
We undertook an experiment using 4-bit Ripple Carry Adders which comprises of
four interconnected circuits. These circuits are connected with each other by the carry
from one circuit to another, and they compute portions of the total sum in each circuit.
CONCLUSION:
I observed how the adder circuit worked and learned the basic concepts of binary
addition. The basic idea of carry propagation between stages was still clear to me.
Throughout the experiment, it was clear how straightforward and simple Ripple Carry
Adders are to understand. All things considered, our experiment gave us a practical
learning opportunity that improved our comprehension of digital logic and adder circuit
behavior.

Rubrics:

All circuit diagrams are running 75%

using simulation software

Questions 15%

Observation and Conclusion 15%

Total

--------------------------------------------------------END-----------------------------------------------