Table 4 Performance comparison of different square rooting methods based on the total number of clock cycles.
From: Novel seed generation and quadrature-based square rooting algorithms
Square rooting method | Number of iterations | +, -, &, |, \({^{\hat{\,}}}\) | \({\ll , \gg }\) | Compare | \({\times }\) | \({\div }\) | Clock cycles |
|---|---|---|---|---|---|---|---|
Nonrestoring | 12 | 60 | 60 | 13 | 0 | 0 | 313 |
Newton–Raphson | 2 | 4 | 2 | 3 | 0 | 2 | 89 |
Bakhshali | 1 | 4 | 2 | 2 | 2 | 2 | 92 |
Goldschmidt | 2 | 8 | 2 | 3 | 8 | 0 | 35 |
Polynomial approximation | 1 | 5 | 0 | 0 | 17 | 0 | 39 |
Dianov et al. | 1 | 6 | 5 | 4 | 2 | 0 | 34 |
Proposed algorithm | 1 | 2 | 1 | 0 | 2 | 2 | 85a |
