A Linear Convergent Functional Iterative DivisionWithout a Look-Up Table

We propose a modified Goldschimdt reciprocation algorithm for single precision computation, without using a look-up table. It is a variable latency algorithm i.e. the number of iterations depends on the input operands that provide a linear convergence. Multiplying with the dividend results division, our method requires a cycle for each iteration, performing multiply add and Booth recoding in a cycle. Initial approximation is a two´s complement of the divisor, which can be performed during partial product summation. The implementation is described in IBM G5 FPU(floating point unit) and MIPS R10000 processor multiplier, evaluated and compared with conventional processors. It offers a good trade-off between performance and area, making it suitable for mobile computing applications such as PDA(personal digital assistant), UPC(ultra personal computer), mobile phone, tablet PC(personal computer) etc