FPGA implementation of fast radix 4 division algorithm

The flexibility of field programmable gate arrays (FPGAs) can provide arithmetic intensive applications with the benefits of custom hardware but without the high cost of custom silicon implementations. In this paper, we present the adaptation of a fast radix 4 division algorithm (Srinivas and Parthi, 1994) for lookup table based FPGAs implementation. In this algorithm, the quotient digits are determined by observing three most-significant radix 2 digits of the partial remainder and independent of the divisor. The implementation has been done with Xilinx technology and FPGA-Advantage CAD tools.

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

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

[3]  Milos D. Ercegovac,et al.  On digit-recurrence division implementations for field programmable gate arrays , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

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

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