edited by
5,999 views
1 1 vote

Figure Ⅰ shows a $4$-bit ripple carry adder realized using full adders and Figure Ⅱ shows the circuit of a full-adder (FA). The propagation delay of the XOR, AND and OR gates in Figure Ⅱ 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

         

Figure II

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

2 Answers

0 0 votes

for S0=2 EX-OR Gate Delay = 20*2 = 40 ns

Z1=1 EX-OR + 1 AND + 1 OR Gate Delay = 20 + 15 + 10 = 45 ns

for next 3 FA, the carry propagation delay will be = 1 AND + 1 OR Gate Delay = 15 + 10 = 25 ns

Time taken to stabilize the output = Total Propagation Delay = 45 + 25*3 = 120 ns 

Here i've also considered the time to stabilize for the final carry bit Z4

Answer:
Position:
Show:

Related questions

4 4 votes
1 1 answer
1.1k
1.1k views
admin asked Nov 23, 2017
1,086 views
Consider the circuit shown in the figure. The Boolean expression $F$ implemented by the circuit is$\overline{X} \overline{Y} \overline{Z} + X Y +\overline{Y} Z $$\overlin...
1 1 vote
0 0 answers
709
709 views
admin asked Nov 25, 2017
709 views
The state diagram of a finite state machine (FSM) designed to detect an overlapping sequence of three bits is shown in the figure. The FSM has an input 'In' and an output...
0 0 votes
0 0 answers
784
784 views
Milicevic3306 asked Mar 27, 2018
784 views
For the circuit shown in the figure, the delays of NOR gates, multiplexers and inverters are $2$ ns, $1.5$ ns and $1$ ns, respectively. If all the inputs $P, Q, R, S$ and...
0 0 votes
0 0 answers
546
546 views
admin asked Nov 23, 2017
546 views
For the circuit shown in the figure, P and Q are the inputs and Y is the output.The logic implemented by the circuit isXNOR XORNOROR

Add Synced Question

×