1,304 views
0 votes
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 votes
1 votes

it is order of n in case of RCA.

Related questions

1 votes
1 votes
3 answers
1
Na462 asked Nov 15, 2018
948 views
0 votes
0 votes
2 answers
2
Na462 asked Oct 1, 2018
847 views
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