Powering by a table look-up and a multiplication with operand modification

An efficient method for generating a power of an operand, i.e., X ^p for an operand X and a given p, is proposed. It is applicable to ps in the form of ±2^k, where k is any integer and of ±2(k₁) ±2(-k₂), where k₁ is any integer and k₂ is any nonnegative integer. The reciprocal, the square root, the reciprocal square root, the reciprocal square, the reciprocal cube, and so forth are included. The method is a modification of the piecewise linear approximation. A power of an operand is generated through a table look-up and a multiplication with operand modification. The same accuracy is achieved as the piecewise linear approximation. The multiplication and an addition required for the piecewise linear approximation are replaced by only one double-sized multiplication with a slight modification of the operand and, hence, one clock cycle may be reduced. The required table size is reduced because only one coefficient instead of two has to be stored