Register

Adder

1,724 views
0 0 votes
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 similar for other adders too). Plz also share some good resource about these two adders

1 Answer

1 1 vote

it is order of n in case of RCA.

Voting & Accepting an answer helps improve the community
← Previous · RoutingNext → · combinational ckt
← Previous in category · OverflowNext in category → · combinational ckt
Position:
Show:

Related questions

1 1 vote
3 3 answers
2.2k
2.2k views
Na462 asked Nov 15, 2018
2,162 views
Full adder
0 0 votes
2 2 answers
1.5k
1.5k views
Na462 asked Oct 1, 2018
1,534 views
Full adder
3 3 votes
3 3 answers
4.9k
4.9k views
admin asked Mar 31, 2020
4,867 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,296 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 _...