Tag: 4 bit ripple carry adder theory

Ripple Carry Adder

What is Ripple Carry Adder?

 

  • A ripple carry adder also known as “n-bit parallel adder” is a combinational logic circuit used for the purpose of adding two n-bit binary numbers and requires ‘n’ full adders in the circuit.

 

4-bit Ripple Carry Adder-

 

  • 4-bit ripple carry adder is used for the purpose of adding two 4-bit binary numbers.
  • In mathematics, any two 4-bit binary numbers A3A2A1A0 and B3B2B1B0 will be added as-

 

 

Using ripple carry adder, this addition will be carried out as shown by the following logic diagram-

 

 

Logic Diagram for 4-bit Ripple Carry Adder

 

As shown, Ripple Carry Adder works in different stages where the carry out produced by each full adder as output serves as the carry in input for its adjacent most significant full adder. When the carry in becomes available to the full adder, it activates that full adder and it comes into operation.

 

Also Read- How Full Adder computes the output sum bit and carry bit?

 

Working of a 4-bit Ripple Carry Adder-

 

Suppose we want to add two 4 bit binary numbers 0101 (A3A2A1A0) and 1010 (B3B2B1B0). Using ripple carry adder, this addition will be carried out as explained below-

 

Stage-01:

 

When Cin will be fed as input to full Adder A, it will activate full adder A.

Then, At Full Adder A,

  • A0 = 1
  • B0 = 0
  • Cin = 0

The sum bit and carry bit produced as output by full adder A will be calculated by full adder A as-

 

Calculating S0

S0   = A0 ⊕  B0 ⊕ Cin

= 1 ⊕ 0 ⊕ 0

= 1

∴ S0 = 1

Calculating C0

C0   = A0B0 ⊕  B0Cin ⊕ CinA0

= 1.0 ⊕ 0.0 ⊕ 0.1

= 0 ⊕ 0 ⊕ 0

= 0

∴ C0 = 0

 

Stage-02:

 

Now, when Co will be fed as input to full adder B by full adder A, it will activate full adder B.

Then, At Full Adder B,

  • A1 = 0
  • B1 = 1
  • C0 = 0

The sum bit and carry bit produced as output by full adder B will be calculated by full adder B as-

 

Calculating S1

S1   = A1 ⊕  B1 ⊕ C0

= 0 ⊕ 1 ⊕ 0

= 1

∴ S1 = 1

Calculating C1

C1   = A1B1 ⊕  B1C0 ⊕ C0A1

= 0.1 ⊕ 1.0 ⊕ 0.0

= 0 ⊕ 0 ⊕ 0

= 0

∴ C1 = 0

 

Stage-03:

 

Now, when C1 will be fed as input to full adder C by full adder B, it will activate full adder C.

Then, At Full Adder C,

  • A2 = 1
  • B2 = 0
  • C1 = 0

The sum bit and carry bit produced as output by full adder C will be calculated by full adder C as-

 

Calculating S2

S2   = A2 ⊕  B2 ⊕ C1

= 1 ⊕ 0 ⊕ 0

= 1

∴ S2 = 1

Calculating C2

C2   = A2B2 ⊕  B2C1 ⊕ C1A2

= 1.0 ⊕ 0.0 ⊕ 0.1

= 0 ⊕ 0 ⊕ 0

= 0

∴ C2 = 0

 

Stage-04:

 

Now, when C2 will be fed as input to full adder D by full adder C, it will activate full adder D.

Then, At Full Adder D,

  • A3 = 0
  • B3 = 1
  • C2 = 0

The sum bit and carry bit produced as output by full adder D will be calculated by full adder D as-

 

Calculating S3

S3   = A3 ⊕  B3 ⊕ C2

= 0 ⊕ 1 ⊕ 0

= 1

∴ S3 = 1

Calculating C3

C3   = A3B3 ⊕  B3C2 ⊕ C2A3

= 0.1 ⊕ 1.0 ⊕ 0.0

= 0 ⊕ 0 ⊕ 0

= 0

∴ C3 = 0

Thus finally,

  • Output Sum = S3S2S1S0 = 1111
  • Output Carry = C= 0

 

Why Ripple Carry Adder is called so?

 

  • In Ripple Carry Adder, the carry out produced by each full adder as output serves as the carry in input for its next most significant full adder.
  • Since in ripple carry adder, each carry bit ripples or waves into the next stage, that’s why it is called by the name “Ripple Carry Adder”.

 

Also Read- How Delay is calculated in Ripple Carry Adder?

 

Limitation of Ripple Carry Adder-

 

  • Ripple Carry Adder does not allow all full adders to be used simultaneously and each full adder has to necessarily wait till the carry bit becomes available from its adjacent less significant full adder.
  • This increases the propagation time and due to this reason, ripple carry adder becomes extremely slow which is considered to be the biggest disadvantage of using ripple carry adder.

 

Also Read- Carry Look Ahead Adder

 

Get more notes and other study material of Digital Electronics.

Watch video lectures by visiting our YouTube channel LearnVidFun.