Difference between revisions of "Adder"
(+cat) |
m (+link) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
An '''adder''' is a collection of [[hardware]] (now [[gate]]s) which, as the name implies, can add together the numbers on its two inputs. | An '''adder''' is a collection of [[hardware]] (now [[gate]]s) which, as the name implies, can add together the numbers on its two inputs. | ||
| − | The primary limit on the speed of a parallel adder is the 'ripple propagation' of carries, since [[bit]] n cannot be computed until it is known whether or not there is a carry out of bit n-1. In a simple implementation, this effectively sequentially stacks the delays across the entire adder (consider the case of the case of the addition of 01 to 077777). | + | The primary limit on the speed of a [[parallel]] adder is the 'ripple [[propagation delay|propagation]]' of carries, since [[bit]] n cannot be computed until it is known whether or not there is a carry out of bit n-1. In a simple implementation, this effectively sequentially stacks the delays across the entire adder (consider the case of the case of the addition of 01 to 077777). |
A number of 'carry lookahead' mechanisms have been devised to try and bypass the propagation delays inherent in sequential carries. (This has been the case since the days of Babbage, whose machines implemented clever carry mechanisms.) | A number of 'carry lookahead' mechanisms have been devised to try and bypass the propagation delays inherent in sequential carries. (This has been the case since the days of Babbage, whose machines implemented clever carry mechanisms.) | ||
Latest revision as of 10:18, 8 August 2021
An adder is a collection of hardware (now gates) which, as the name implies, can add together the numbers on its two inputs.
The primary limit on the speed of a parallel adder is the 'ripple propagation' of carries, since bit n cannot be computed until it is known whether or not there is a carry out of bit n-1. In a simple implementation, this effectively sequentially stacks the delays across the entire adder (consider the case of the case of the addition of 01 to 077777).
A number of 'carry lookahead' mechanisms have been devised to try and bypass the propagation delays inherent in sequential carries. (This has been the case since the days of Babbage, whose machines implemented clever carry mechanisms.)
(The adders in serial computers do not face this issue, of course.)
