CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Rotational EMF

A 16-bit ripp...

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

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.

Suggest Corrections

thumbs-up

0

Similar questions

Q. Figure I shows a 4-bit ripple carry adder realized using full adders and Figure II shows the circuit of a full-adder (FA). The propagation delay of the XOR, AND and OR gates in Figure II are 20 ns, 15 ns and 10 ns, respectively. Assume all the inputs to the 4-bit adder are initially reset to 0.

Figure I:

At t= 0, the inputs to the 4-bit adder are changed to

X_{3} X_{2} X_{1} X_{0} = 1100, Y_{3} Y_{2} Y_{1} Y_{0} = 0100 a n d Z_{0} = 1

. The output of the ripple carry adder will be stable at t (in ns) =

Q. A 4 bit ripple counter and a 4 bit synchronous counter are made using flip flops having a propagation delay of 10 ns each. If the worst case delay in the ripple counter and the synchronous counter be R and S respectively. then

Q. A 4-bit ripple counter and a 4-bit synchronous counter are made by flip -flops having a propagation delay of 10 ns each. If the worst case delay in the ripple counter and the synchronous counter be R and S respectively then

Q. A 4-bit modulo-16 ripple counter uses JK flip-flops. If the propagation delay of each FF is 50 ns, the maximum clock frequency that can be used is equal to:

Q. 1-bit full-adder takes 20 ns to generate carry-out bit and 40 ns for the sum bit. The maximum rate of addition per second, when four 1-bit full adders are cascaded is _______

\times 10^{6} / s e c .

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Motional EMF

PHYSICS

Watch in App

explore_more_icon

Explore more

Standard XII Physics

Join BYJU'S Learning Program

CrossIcon