Implementation of different square root algorithms
Marco Franke, A.T. Schwarzbacher, Michael Brutscheck, S. Becker · China-Ireland International Conference on Information and Communications Technologies (CIICT 2007) · 2007
This work presents fixed point square root algorithms and their implementation. These algorithms are referred to as non-restoring and restoring algorithm. This paper compares two such algorithms with a traditional lookup table (LUT) implementation of the square root algorithm. The LUT and the square root algorithms have an input range of 0 to 1. Furthermore, the square root algorithms and the LUT were implemented using different bitwidths. This research compared the input bitwidths of 4 bit, 8 bit, 16 bit, 32 bit and 64 bit. The power consumption, the area consumption and the propagation delay are then investigated. It will be shown the different behaviour of the non-restoring square root algorithm, of the restoring square root algorithm and of the lookup table square root causes different implementations to be useful for different applications. The in this paper presented results will therefore, provide the hardware designer with guidelines in choosing the most appropriate implementation for a given task.