A Radix-2 Digit-by-Digit Architecture for Cube Root

A radix-2 digit-recurrence algorithm and architecture for the computation of the cube root are presented in this paper. The original recurrence based on the concept of completing the cube is modified to allow an efficient implementation of the algorithm and the cycle time and area cost of the resulting architecture are estimated as 7.5 times the delay of a full adder and around 9,000 nandl cells, respectively, for double-precision computations