2,191 views
1 1 vote

 

3 Answers

0 0 votes
3*14+44= 86
0 0 votes
Time after which output sum bit becomes available from the last full adder   

= Time taken for its carry in to become available + Sum propagation delay of full adder

= { Total number of full adders before last full adder X Carry propagation delay of full adder } + Sum propagation delay of full adder

= 3 X 14 +44

= 86
0 0 votes

let T(n) is the time taken by nth full adder as it has to wait for 14ns(PD$_C$) for previous adder to calculate its carry

so we can form a recurrence

T(n)  =  T(n-1) + PD$_C$  (Propagation delay of carry)

T(1) = (PD$_s$) Propagation delay of sum (as for only 1 full adder time taken = 44ns(=(PD$_s$)

solving by back substitution 

T(n) = T(n-2) + (PD$_C$)+ (PD$_C$)

 T(n) = T(n-2) + 2*(PD$_C$)

  •  
  •  
  •  

 T(n) = T(n-k) + k*(PD$_C$)

if n-k=1 ,k=n-1

 T(n) = T(n-(n-1)) + (n-1)*(PD$_C$)

 T(n) = T(1) + (n-1)*(PD$_C$)

 T(n) = (PD$_C$) + (n-1)*(PD$_C$)  we can derive this formula by ton a ways 

here n=4 (PD$_C$) = 14ns (PD$_s$) =44ns

 T(4) = 44 + (4-1)*(14)

T(4) =86ns

Position:
Show:

Related questions

1 1 vote
0 0 answers
867
867 views
superak96 asked Oct 18, 2018
867 views
The Cout function of a 3-bit adder is as follows:AB + Cin (A ⊕ B) - iIt, being a majority function, can also be written as:AB+BCin+CinAwhich is equivalent toAB + Cin (A...
0 0 votes
2 2 answers
1.5k
1.5k views
Na462 asked Oct 1, 2018
1,546 views
0 0 votes
1 1 answer
1.7k
1.7k views
srestha asked May 21, 2018
1,730 views
One ripple carry adder is adding two n-bit integers. The time complexity to perform addition using this adder is (We know carry look ahead adder takes time log n. Is it s...
5 5 votes
2 2 answers
191
191 views
GO Classes asked Jun 18
191 views
In a full adder, the carry output is $C_{out}=AB+C_{in}(A\oplus B)$. For which input combinations does the full adder generate carry independent of $C_{in}$?$A=0,B=0$ $A=...