Given below are two statements : one is labelled as Assertion (A) and the other is labelled as Reason (R).
Assertion (A) : In a ripple carry adder, carry propagation delay increases linearly with the number of bits.
Reason (R) : Each bit addition must wait for the carry output from the previous stage.
In the light of the above statements, choose the most appropriate answer from the options given below :
Show Hint
To fix this "linear" bottleneck, modern CPUs use Carry Look-ahead Adders (CLA), which calculate carries in parallel using logic, making the delay logarithmic instead of linear.