Abstract
A division algorithm suitable for pipelining is presented. The algorithm possesses the on-line property: that is, to generate the j**t**h digit of a result (where a digit consists of n bits for base 2**n), it is necessary and sufficient to have the operands available only up to j**t**h digit plus a predetermined number of extra digits which correspond to an ″on-line delay″ . This delay is shown to be a small, positive, radix dependent constant. The implementation of this algorithm and the implications on cost and speed are then presented. Alterations in the design making the algorithm suitable for pipelining and its benefits are discussed.
| Original language | English (US) |
|---|---|
| Pages | 24-30 |
| Number of pages | 7 |
| State | Published - 1978 |
| Event | Conf Proc Annu Symp Comput Archit 5th - Palo Alto, CA, USA Duration: Apr 3 1978 → Apr 5 1978 |
Other
| Other | Conf Proc Annu Symp Comput Archit 5th |
|---|---|
| City | Palo Alto, CA, USA |
| Period | 4/3/78 → 4/5/78 |
All Science Journal Classification (ASJC) codes
- General Engineering