Algorithm for high speed shared radix 8 division and radix 8 square root
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
An algorithm for performing radix-8 division and square root in a shared hardware is described. To achieve short iteration cycle time, it utilizes an optimized `next quotient/root prediction PLA' generally used in a radix-4 SRT division with minimal redundancy. In addition, the partial remainder, partial radicand, quotient, and root are generated and saved in redundant forms, thereby eliminating the slow-carry look-ahead adder from the critical path timing of the iteration cycle. This method successfully avoids the need to generate nontrivial divisor/root multiples (3x, 5x, etc.) and also avoids the complex radix-8 next quotient prediction PLA typically used in a conventional radix-8 SRT division. It also shows that a significant amount of hardware sharing can be achieved when square root and division are performed at the same radixKeywords
This publication has 6 references indexed in Scilit:
- An NMOS 64b floating-point chip setPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A 40 MHz 64-bit floating-point co-processorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Algorithm for high speed shared radix 4 division and radix 4 square-rootPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Parallel multipliers based on horizontal compressorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- 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
- Higher-Radix Division Using Estimates of the Divisor and Partial RemaindersIEEE Transactions on Computers, 1968