Subscribe
Issue No.04  April (2008 vol.57)
pp: 562566
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2007.70848
ABSTRACT
A radix2 digitrecurrence 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 9000 $nand2$ cells, respectively, for doubleprecision computations.
INDEX TERMS
HighSpeed Arithmetic, Cost/performance
CITATION
Alex Pi?eiro, Javier D. Bruguera, Fabrizio Lamberti, Paolo Montuschi, "A Radix2 DigitbyDigit Architecture for Cube Root", IEEE Transactions on Computers, vol.57, no. 4, pp. 562566, April 2008, doi:10.1109/TC.2007.70848
REFERENCES
