2,436 views
4 votes
4 votes

2 Answers

1 votes
1 votes

So we care about only the carry generated by FA because these act as inputs to the other FA.

So computing time for Carry C1,C2,C3,C4,C5,C6,C7.

we get 18+27+23+32+18+23+27 = 168 ns

So for last FA B2 we get compute sum also S8 = 23ns

seconds per addition = 168+23=191ns

additions per second  = 1 / seconds per addition. 

                                    = 1 / 191ns = 5.23*10^6 

edited by
0 votes
0 votes
It is (1÷310ns) = 3.23* 10^6.

Because S7 bit of sum takes 310ns to get generated.
FA_C2 adder receives its input-carry bit C6 after 141ns and this adder takes 169 ns to generate S7. In this way we get S7 bit after (141 + 169 = 310 ns).

Actually here we get S7 bit (at 310 ns) after S8(at 191 ns). Therefore complete output is generated after 310 ns.

Related questions

0 votes
0 votes
1 answer
2
val_pro20 asked May 16, 2019
1,119 views
$Exclusive-OR$ gate has a propagation delay of $10$ ns and that the $AND$ or $OR$ gates have a propagation delay of $5$ ns.What is the total propagation delay time in the...
0 votes
0 votes
1 answer
4
Niks55 asked Oct 5, 2018
1,243 views
How many gate delays are there in overflow for ripple carry adder?