retagged by
3,870 views
3 votes
3 votes

In which of the following adder circuits, the carry look ripple delay is eliminated?

  1. Half adder
  2. Full adder
  3. Parallel adder
  4. Carry-look ahead adder
retagged by

3 Answers

4 votes
4 votes

carry look ripple delay is eliminated in Carry-look-ahead adder as carry is already provided before the operation starts .

carry is calculated as follows:-

Substituting C1 into C2, then C2 into C3, then C3 into ​​​​​​​C4 yields the following expanded equations: 

Here G (carry generator) is equal to 

P(propagate) as follows

 

all the carry are calculated using the above formula and provided to input as mentioned in a diagram. Thus ripple delay is eliminated.

 

 

follow this link for further clarification:- https://www.geeksforgeeks.org/carry-look-ahead-adder/

 

0 votes
0 votes

Option D; as in CLA the carry is generated in parallel. Hence no concept of ripple carry.

Please refer to the carry equation
Where $Gi$ is the generator Function and $Pi$ is the propagation function.
$Gi$ = $AiBi$ (Ai,Bi are Bit pairs of the two n bit numbers)
$Pi$ = $Ai+Bi$ or $Ai ⊕ Bi$
Follow CLA for further clarification.
Answer:

Related questions

2 votes
2 votes
2 answers
1
admin asked Mar 31, 2020
1,161 views
How many RAM chips of size $(256K \times 1 \text{ bit})$ are required to build $1$M Byte memory?$8$$10$$24$$32$
2 votes
2 votes
3 answers
2
admin asked Mar 31, 2020
1,303 views
Disadvantage of dynamic RAM over static RAM ishigher power consumption.variable speed.need to refresh the capacitor charge every once in two milliseconds.higher bit densi...
0 votes
0 votes
0 answers
3