847 views
0 votes
0 votes

2 Answers

1 votes
1 votes
Time taken in a ripple carry adder is = (n-1)*time to propagate carry + time of a single full adder.[if carry propagate time<sum generate time]

=3*20+40

=100ns.
0 votes
0 votes
This is 1- bit rca
So time at which carry bit becomes available    
Tcarry=n*tpd(carry)
=1*20=20 ns
And time at which output sum bit becomes available Ts= (n-1)*tpdcarry+tpd(sum)
                     =0*20+40=60ns

So total propagation delay in ripple carry adder=Tcarry+Ts=20+40=60ns
60 is right answer

Related questions

1 votes
1 votes
3 answers
1
Na462 asked Nov 15, 2018
948 views
0 votes
0 votes
1 answer
2
srestha asked May 21, 2018
1,305 views
One ripple carry adder is adding two n-bit integers. The time complexity to perform addition using this adder is (We know carry look ahead adder takes time log n. Is it s...
3 votes
3 votes
3 answers
3
admin asked Mar 31, 2020
3,926 views
In which of the following adder circuits, the carry look ripple delay is eliminated?Half adderFull adderParallel adderCarry-look ahead adder
0 votes
0 votes
0 answers
4