A Fast Radix-4 Division Algorithm and Its Architecture

In this paper we present a fast radix-4 division algorithm for floating point numbers. This method is based on Svoboda's division algorithm and the radix-4 redundant number system. The algorithm involves a simple recurrence with carry-free addition and employs prescaling of the operands. In the proposed divider implementation, each radix-4 digit (belonging to set {-3,...,+3}) of the quotient and partial remainder is encoded using two radix-2 digits (belonging to the set {-1,0,+1}) and this leads to hardware simplicity. The quotient digits are determined by observing three most-significant radix-2 digits of the partial remainder and independent of the divisor. The architecture presented for the proposed algorithm is faster than previously proposed radix-4 dividers, which require at least four digits of the partial remainder to be observed to determine quotient digits. >

[1]  Keshab K. Parhi,et al.  A fast VLSI adder architecture , 1992 .

[2]  N. Burgess.  A fast division algorithm for VLSI , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[3]  H. T. Kung,et al.  A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.

[4]  Ansi Ieee,et al.  IEEE Standard for Binary Floating Point Arithmetic , 1985 .

[5]  Luigi Ciminiera,et al.  Over Redundant Digit Sets and the Design of Digit-by-Digit Division Units , 1994, IEEE Trans. Computers.

[6]  Jan Fandrianto.  Algorithm for high speed shared radix 4 division and radix 4 square-root , 1987, 1987 IEEE 8th Symposium on Computer Arithmetic (ARITH).

[7]  George S. Taylor.  Radix 16 SRT dividers with overlapped quotient selection stages: A 225 nanosecond double precision divider for the S-1 Mark IIB , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[8]  D. Zuras,et al.  Balanced delay trees and combinatorial division in VLSI , 1986 .

[9]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[10]  Tomás Lang,et al.  Simple Radix-4 Division with Opterands Scaling , 1990, IEEE Trans. Computers.

[11]  Damiel E. Atkins.  Higher-Radix Division Using Estimates of the Divisor and Partial Remainders , 1968, IEEE Transactions on Computers.

[12]  Naofumi Takagi,et al.  Design of high speed MOS multiplier and divider using redundant binary representation , 1987, 1987 IEEE 8th Symposium on Computer Arithmetic (ARITH).

[13]  Miloš D. Ercegovac.  Division and square root , 1994 .

[14]  Keshab K. Parhi,et al.  A fast radix 4 division algorithm , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[15]  Chin Chin Tung.  A Division Algorithm for Signed-Digit Arithmetic , 1968, IEEE Transactions on Computers.

[16]  J. B. Gosling,et al.  Design of a Hih-Speed Square Root Multiply and Divide Unit , 1987, IEEE Transactions on Computers.

[17]  Algirdas Avizienis,et al.  Signed-Digit Numbe Representations for Fast Parallel Arithmetic , 1961, IRE Trans. Electron. Comput..

[18]  Paul Jespers,et al.  A new carry-free division algorithm and its application to a single-chip 1024-b RSA processor , 1989 .

[19]  Tomás Lang,et al.  On-the-Fly Conversion of Redundant into Conventional Representations , 1987, IEEE Transactions on Computers.

[20]  Jan Fandrianto.  Algorithm for high speed shared radix 8 division and radix 8 square root , 1989, Proceedings of 9th Symposium on Computer Arithmetic.

[21]  John V. McCanny,et al.  New algorithms and VLSI architectures for SRT division and square root , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[22]  Luigi Ciminiera,et al.  Design of a Radix 4 Division Unit with Simple Selection Table , 1992, IEEE Trans. Computers.