Figure I shows a 4-bit ripple carry adder realized using full adders and…

GATE · 2017 · EC · Set 2 · Electronics and Communication Engineering

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: four full adders in ripple carry order from bit 0 right to bit 3 left. Figure II: each full adder uses two XOR gates for sum and two AND gates plus OR for carry.

At t=0t=0, the inputs to the 4-bit adder are changed to X3X2X1X0=1100X_3X_2X_1X_0=1100, Y3Y2Y1Y0=0100Y_3Y_2Y_1Y_0=0100 and Z0=1Z_0=1. The output of the ripple carry adder will be stable at tt (in ns) = ________.

Attempted by 5 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…