edited by
468 views
0 votes
0 votes
I know the Concept of Binary ripple carry adder but i don't understand about the delay.I know that the output wont be generated until carry is propagated.So how to find The actual delay which will be there and how to determine which input will take max delay ?

I cant solve the Questions involving the calculations on finding Delay.Can anybody explain how to do it using an Example ? Please
edited by

2 Answers

0 votes
0 votes

Binary ripple carry adder:-

To calculate delay find the longest path from the carry in to carry out

Taking 4-bit ripple carry adder:-

$sum=a0\Theta b0\Theta cin$

$carry out=a0*b0+(a0\Theta b0) * cin$

Now you can calculate a0 exor b0= $a0\Theta b0$ and a0*b0 => delay of maximum (Exor gate, AND) as both are working parallely 

after getting a0 exor b0 find ( $a0\Theta b0$ ) * cin => delay AND gate delay.

And now perform one OR operation to get carry out

$carry out=a0*b0+(a0\Theta b0) * cin$ =>> delay OR gate

First stage delay => Exor+AND+OR

now in second stage computing a1 and b1 sum,

a1 exor b1 and a1 and b1 is parallely computed as it is independent of previous stage. so delay in second stage is basically :- AND to compute ( a1 exor b1 ) AND previous stage carry + OR to compute cout.

Second stage delay =>> AND+OR

similarly Third stage delay =>> AND+OR

Fourth stage delay ==> AND+OR

Total delay= one EXOR delay + 4(AND+OR)

Related questions

0 votes
0 votes
2 answers
2
rajveer43 asked Jan 12
178 views
The number of full and half-adders required to add $32$-bit numbers is______________________
0 votes
0 votes
0 answers
3
Redcom1988 asked Dec 23, 2023
176 views
Design a counter according to the state diagram above using only NAND gates and JK Flip-flops (if needed) complete with state tables
0 votes
0 votes
0 answers
4