Multiplier-less and Table-less Linear Approximation for Square-Related Functions

Abstract

Square related functions such as square inverse square square root and Inverse square root operations are widely used in digital signal processing and digital communication algorithms and their efficient realizations are commonly required to reduce the hardware complexity In the implementation point of view approximate realizations are often de sired if they do not degrade performance significantly In this paper we propose new linear approximations for the square related functions The traditional linear approximations need multipliers to calculate slope off sets and tables to store initial offset values and slope values whereas the proposed approximations exploit the inherent properties of square related functions to linearly interpolate with only simple operations such as shift concatenation and addition which are usually supported in modern VLSI systems Regardless of the bit width of the number system more importantly the maximum relative errors of the proposed approximations are bounded to 6 25% and 3 13% for square and square root functions respectively For inverse square and inverse square root functions the maximum relative errors are bounded to 12 5% and 6 25% if the input operands are represented in 20 bits respectively