Issue No. 09 - September (1981 vol. 30)
J.H.P. Zurawski , Department of Computer Science, University of Manchester
The division operation has proved to be a much more difficult function to generate efficiently than the other elementary arithmetic operations. This is due primarily to the need to test the result of one iteration before proceeding to the next. The technique described in this contribution reduces the iteration time by the use of a redundant quotient representation, which avoids the need to complete the arithmetic operation. A borrow?save subtractor (analogous to a carry?save adder) can then be used for the arithmetic. Further improvement is obtained by use of a lookahead decoding technique. Cost reductions are obtained either by use of uncommitted logic arrays, or by a novel borrow?save system using commercially available adder circuitry. A comparison of a number of divider units with a wide range of cost and speed is included.
uncommitted logic arrays (gate arrays), Borrow?save subtraction, carry?save addition, digital arithmetic, digital division, group subtractor, iterative division
J.B. Gosling, J.H.P. Zurawski, "Design of High-Speed Digital Divider Units", IEEE Transactions on Computers, vol. 30, no. , pp. 691-699, September 1981, doi:10.1109/TC.1981.1675869