wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

A 16-bit ripple carry adder is realized using 16 identical full adders (FA) as shown in the figure. The carry-propagation delay of each FA is 12 ns and the sum-propagation delay of each FA is 15 ns. The worst case delay (in ns) of this 16-bit adder will be



  1. 195

Open in App
Solution

The correct option is A 195
Full adder is a combinational circuit that performs the sum of three bits i.e. add two bits and a carry from previous addition and produces output as sum and carry.
Given carry propagation delay of each
FA= 12 nsec.
Sum-propagation delay of each FA = 15 nsec.



It can be seen from above diagram, full adder is not received from previous full adder.
So, in 16-bit ripple carry adder, worst case delay of this 16-bit adder will be
= (15 x 12) nsec. + 15 nsec.
= 195 nsec.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Motional EMF
PHYSICS
Watch in App
Join BYJU'S Learning Program
CrossIcon