Parallel square and cube computations

Abstract

Typically multipliers are used to compute the square and cube of an operand. A squaring unit can be used to compute the square of an operand faster and more efficiently than a multiplier This paper proposes a parallel cubing unit that computes the cube of an operand 25 to 30% faster than can be computed using multipliers. Furthermore, the reduced squaring and cubing units are mathematically modeled and the performance and area requirements are studied for operands up to 54 bits in length. The applicability of the proposed cubing circuit is discussed with relation to the current Newton-Raphson and Taylor series function evaluation units.