Analysis of Fast Radix-10 Digit Recurrence Algorithms for Fixed-Point and Floating-Point Dividers on FPGAs

Algorithm 1

Pseudocode for type1 digit recurrence division.

(1) Compute 𝛿₁=10𝑤𝑗−𝑑

     ⋮

     𝛿₉=10𝑤𝑗−9𝑑

(2) if 𝛿₁<0 then

    𝑧_𝑗+1=0 and 𝑤𝑗+1=10⋅𝑤𝑗

   else if 𝛿₂<0 then

    𝑧_𝑗+1=1 and 𝑤𝑗+1=𝛿₁

       ⋮

   else if 𝛿₉<0 then

    𝑧_𝑗+1=8 and 𝑤𝑗+1=𝛿₈

   else

    𝑧_𝑗+1=9 and 𝑤𝑗+1=𝛿₉