Elbrus International Limited

Vitaly M Pivnenko

Valery Y Gorshtein

Yuri N Parakhin

An SRT division unit for performing a novel SRT division algorithm is presented. The novel SRT division algorithm comprises a method for performing SRT division using a radix r. As one skilled in the art will appreciate, the radix r dictates the number of quotient-bits k generated during a single iteration. The relationship between radix r and the number of quotient-bits k generated in a single iteration is r&equals;2 . The number of iterations needed to determine all quotient-digits is N, such that N&equals;54/k for a 64 bit floating point value. In accordance with one embodiment of the present invention, the SRT division unit generates a scaling factor M, which comprises scaling sub-factors M1 and M2 according to the relationship M&equals;r*M1&plus;M2. Next, the division unit generates a scaled divisor Y by multiplying a divisor DR by scaling factor M, such that said scaled divisor Y&equals;DR*M&equals;r(DR*M1)&plus;DR*M2. In addition, the division unit generates partial remainder values w&lsqb;00&rsqb; and w&lsqb;0&rsqb; by muliplying a dividend DD by scaling sub-factor M1 and scaling factor M, respectively. Partial remainder value w&lsqb;00&rsqb;&equals;DD*M1, and partial remainder value w&lsqb;0&rsqb;&equals;DD*M&equals;r(DD*M1)&plus;DD*M2. Scaled divisor Y and partial remainders w&lsqb;0&rsqb; and w&lsqb;00&rsqb; then are used to generate quotient-digits and additional partial remainders. Accordingly, the division unit performs iterations j which generate quotient-digits according to the formula q&lsqb;j&rsqb;&equals;SEL(r *w &lsqb;j&minus;2&rsqb;, q&lsqb;j&minus;1&rsqb;). Also, the iterations generate additional partial remainders w&lsqb;j&rsqb; according to the formula w&lsqb;j&rsqb;&equals;rw&lsqb;j&minus;1&rsqb;&minus;q&lsqb;j&minus;1&rsqb;*Y. N iterations are performed, generating all quotient-digits for the division operation.

Growing community of inventors

Moscow, Russia

Vitaly M Pivnenko