Register

Full adder

1,559 views
0 0 votes

2 Answers

1 1 vote
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 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
Voting & Accepting an answer helps improve the community
← Previous · regular expressionNext → · self doubt
← Previous in category · Digital electronicsNext in category → · Prime implicants and...
Position:
Show:

Related questions

1 1 vote
3 3 answers
2.2k
2.2k views
Na462 asked Nov 15, 2018
2,226 views
Full adder
0 0 votes
1 1 answer
1.7k
1.7k views
srestha asked May 21, 2018
1,747 views
Adder
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 3 votes
3 3 answers
4.9k
4.9k views
admin asked Mar 31, 2020
4,891 views
NIELIT 2016 MAR Scientist B - Section C: 2
In which of the following adder circuits, the carry look ripple delay is eliminated?Half adderFull adderParallel adderCarry-look ahead adder
0 0 votes
0 0 answers
1.3k
1.3k views
ajaysoni1924 asked Apr 3, 2019
1,299 views
Morris Mano Edition 3 Exercise 5 Question 6 (Page No. 198)
(a) Redefine the carry propagate and carry generate as follows:$P _i = A _i + B _ i$$G _i = A _iB _i$Show that the output carry and output sum of a full adder becomes$C _...