search
Log In
0 votes
161 views

Refer : https://gateoverflow.in/8250/gate2015-2-48

Here i dont understood how they calculated 12ns . I got that the first full adder will take 4.8ns time at that 4.8 ns we'll get the carry as well as the sum, in that duration the first XOR Ai xor Bi will be done for subsequent operands but for final sum the carry first need to be propagated through all full adder first

Why 4.8 + 3*2.4 ??

 

in Digital Logic 161 views

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
436 views
Q.A one bit full adder takes 75 nsec to produce sum and 50 nsec to produce carry.A 4 bit parallel adder is designed using this type of full adder. The maximum rate of additions per second can be provided by 4 bit parallel adder......?
asked Dec 8, 2017 in Digital Logic junaid ahmad 436 views
1 vote
2 answers
2
372 views
can anyone tell me wat is the right equation for carry generator in carry lookahead adder ?? Confused .. $ C_{i} = G_{i}+P_{i}C_{i-1}$ $ C_{i+1}=G_{}i+P_{}iC_{}i$
asked Dec 19, 2017 in Digital Logic Puja Mishra 372 views
0 votes
2 answers
3
668 views
Count the 2 Input And, OR and EX-OR gates required in Carry Generator and Look ahead adder. Note :- In the question it is asking about 2 input, not multiple input, for Multiple input AND gates in n bit carry generator we require (n(n+1))/2 and OR Gates n.
asked Sep 30, 2017 in Digital Logic Shubhanshu 668 views
2 votes
0 answers
4
189 views
The condition for overflow in the addition of two 2's complement numbers in terms of the carry propagated by the two most significant bits is ___________.
asked Nov 3, 2017 in Digital Logic Tuhin Dutta 189 views
...