Single clock square root algorithm based on binomial series and its FPGA implementation

Fast Square Root Calculation without Division for High Performance Control Systems of Power Electronics

“…4, which demonstrates that positive and negative peaks are equal. Despite low absolute (22) and relative ( 25) errors of approximation with hyperbolas coinciding with target parabola at borders of interval of approximation, these errors can be decreased more, if zero errors at the end of this interval are not needed (the error function may not be continuously differentiable). In this case, we can change the criteria for definition of hyperbola coefficients.…”

On Computing General Root Algorithms Based on Binomial Expansion, Bernoulli’s Method of Continuous Compound Interest, Series Expansion and Other Modification Methods

“…In addition, Johnson [15], provided an iterative procedure for computing square root. Knill [16], on the other hand developed a modified Babylonian method for calculating square root and Dubeau [17], used a double iteration method to calculate general roots. Bagala et.…”

“…Square rooting algorithm is often employed in field programmable gate array applications of image processing [20], spectrum analyser [26] and many others. Bagala et al [17,27] proposed a single clock square root algorithm applicable in field programmable gate array.…”