Very high radix division with selection by rounding and prescaling
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A division algorithm in which the quotient-digit selection is performed by rounding the shifted residual in carry-save form is presented. To allow the use of this simple function, the divisor (and dividend) is prescaled to a range close to one. The implementation presented results in a fast iteration because of the use of carry-save forms and suitable recodings. The execution time is calculated, and several convenient values of the radix are selected. Comparison with other high-radix dividers is performed using the same assumptions.<>Keywords
This publication has 10 references indexed in Scilit:
- Very high radix division with selection by rounding and prescalingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A 160 ns 54 bit CMOS division implementation using self-timing and symmetrically overlapped SRT stagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast division using accurate quotient approximations to reduce the number of iterationsIEEE Transactions on Computers, 1992
- On-the-fly rounding (computing arithmetic)IEEE Transactions on Computers, 1992
- Simple radix-4 division with operands scalingIEEE Transactions on Computers, 1990
- Radix 16 SRT dividers with overlapped quotient selection stages: A 225 nanosecond double precision divider for the S-1 Mark IIBPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A division algorithm with prediction of quotient digitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Radix-16 Evaluation of Certain Elementary FunctionsIEEE Transactions on Computers, 1973
- On Range-Transformation Techniques for DivisionIEEE Transactions on Computers, 1970
- A Division Algorithm for Signed-Digit ArithmeticIEEE Transactions on Computers, 1968