A Novel Implementation of Radix4 FloatingPointDivision/SquareRootUsing Comparison Multiples

A new implementation for minimally redundant radix-4 floating-point SRT division/square-root (division/sqrt) with the recurrence in the signed-digit format is introduced. The implementation is developed based on the comparison multiples idea. In the proposed approach, the magnitude of the quotient (root) digit is calculated by comparing the truncated partial remainder with 2 limited precision multiples of the divisor (partial root). The digit sign is determined by investigating the polarity of the truncated partial remainder. A timing evaluation using the logical synthesis (Synopsys DC with Artisan 0.18 m typical library) shows a latency of 2.5 ns for the recurrence of the proposed division/sqrt. This is less than of the conventional implementation.

Keywords:

digit recurrence algorithms , SRT division , redundant arithmetic