Sorry sir for such reply :(

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

I know the Concept of Binary ripple carry adder but i don't understand about the delay.I know that the output wont be generated until carry is propagated.So how to find The actual delay which will be there and how to determine which input will take max delay ?

I cant solve the Questions involving the calculations on finding Delay.Can anybody explain how to do it using an Example ? Please

I cant solve the Questions involving the calculations on finding Delay.Can anybody explain how to do it using an Example ? Please

0 votes

Binary ripple carry adder:-

To calculate delay find the longest path from the carry in to carry out

Taking 4-bit ripple carry adder:-

$sum=a0\Theta b0\Theta cin$

$carry out=a0*b0+(a0\Theta b0) * cin$

Now you can calculate a0 exor b0= $a0\Theta b0$ and a0*b0 => delay of maximum (Exor gate, AND) as both are working parallely

after getting a0 exor b0 find ( $a0\Theta b0$ ) * cin => delay AND gate delay.

And now perform one OR operation to get carry out

$carry out=a0*b0+(a0\Theta b0) * cin$ =>> delay OR gate

First stage delay => Exor+AND+OR

now in second stage computing a1 and b1 sum,

a1 exor b1 and a1 and b1 is parallely computed as it is independent of previous stage. so delay in second stage is basically :- AND to compute ( a1 exor b1 ) AND previous stage carry + OR to compute cout.

Second stage delay =>> AND+OR

similarly Third stage delay =>> AND+OR

Fourth stage delay ==> AND+OR

Total delay= one EXOR delay + 4(AND+OR)

0

Actually i just completed studying digital logic and started to solve the Questions,so its becoming little bit hard to understand your solution though its correct.Can you please explain by taking a real example and solve it Please. and thank you for your valuable reply

Sorry sir for such reply :(

Sorry sir for such reply :(

0

Yes sir i studied from morris mano only and there also it was written that total propagation time is equal to the propagation delay of a typical gate times the number of gate levels in the circuit ----->(As far as i understand) means delay taken by number of gates in a level * number of gate level in the circuit am i right ?

for a n bit parallel adder there are 2n gate levels for the carry to propagate through ---> This was little bit unclear So kindly explain in sir.

But still i cant get a clear and satisfactory solved example for calculating the Delay so that i can fully understand it.

for a n bit parallel adder there are 2n gate levels for the carry to propagate through ---> This was little bit unclear So kindly explain in sir.

But still i cant get a clear and satisfactory solved example for calculating the Delay so that i can fully understand it.

- All categories
- General Aptitude 1.2k
- Engineering Mathematics 5k
- Digital Logic 2k
- Programming & DS 3.6k
- Algorithms 3.1k
- Theory of Computation 3.9k
- Compiler Design 1.5k
- Databases 2.9k
- CO & Architecture 2.5k
- Computer Networks 2.9k
- Non GATE 1k
- Others 1.4k
- Admissions 412
- Exam Queries 419
- Tier 1 Placement Questions 17
- Job Queries 55
- Projects 9

34,947 questions

41,991 answers

119,237 comments

41,484 users