Ripple carry adder, Full adder

implementation using half adder

Presented By:
Faisal Ahmed
16CSE006
What is Adder ??
 A n adder is a digital circuit t h a t performs
addition of numbers.

 The most common adders are operated on

binary numbers.

 In processor i t is used to calculate addresses,

table indices, and similar operations.

2
 Full Adder
 Full adder is a logic circuit t h a t adds t w o i nput
operand bits plus a Carry in bit and outputs a Carry
out bit and a sum bit.

 The Sum out (S out ) of a full adder is the XOR of

input operand bits A, B and the Carry in (C i n ) bit.

8
Implementation of Full Adder
using Half Adders
• 2 Half Adders and a OR gate is required to implement a Full Adder.
Implementation of Full Adder
using Half Adders
Summar
y
Parallel Binary
Adders
• As we discussed that a single full adder performs the addition of two
one bit numbers and an input carry.
• For performing the addition of binary numbers with more than one
bit, more than one full adder is required depends on the number bits.
• Thus, a parallel adder is used for adding all bits of the two numbers
simultaneously.
• By connecting a number of full adders in parallel, n-bit parallel adder
is constructed.
Ripple Carry Adder- Introduction

 The ripple carry adder is constructed by

cascading full adder blocks in series
 The carryout of one stage is fed directly t o the
c a r r y - i n of the next stage

 This adder is called a ripple carry adder because

each carry bit gets rippled into the next
stage.

 For an n - b i t ripple adder, we require n full

adders

15
Ripple Carry Adder
 Propagation delays inside the logic circuitry is the
reason behind this
 Propagation delay is t im e elapsed between the
application of an inpu t and occurance of the
corresponding output.
 Consider a NOT gate, The t i m e taken for the NOT
gate’s output t o become “ 0 ” after the application of
logic “ 1 ” t o the NOT gate’s inp ut is the propagation
delay here.
 Similarly the carry propagation delay is the t i m e
elapsed between the application of the carry in signal
and the occurance of the carry out (C o u t ) signal.

16
Ripple Carry Adder-Circuit Diagram

17
Ripple Carry Adder-Logic Diagram

18
Ripple Carry Adder-Truth Table
A1 A2 A3 A4 B4 B3 B2 B1 S4 S3 S2 S1 Carry

0 0 0 0 0 0 0 0 0 0 0 0 0

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

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

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

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

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

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

19
Ripple Carry Adder-Applications

 These carry adders are used mostly in addition

t o n - b i t inpu t sequences.

 These carry adders are applicable in the

digital signal processing and microprocessors.

20
Ripple Carry Adder-Advantages

 We can p e rfor m addition process for n - b i t

sequences to get accurate results.
 The designing of this adder is n o t a
complex process.

21
22