Archivio Istituzionale della RicercaA 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.
A Radix-2 Digit-by-Digit Architecture for Cube Root / Pineiro, J. A.; Bruguera, J. D.; Lamberti, Fabrizio; Montuschi, Paolo. - In: IEEE TRANSACTIONS ON COMPUTERS. - ISSN 0018-9340. - STAMPA. - 57:4:(2008), pp. 562-566. [10.1109/TC.2007.70848]
A Radix-2 Digit-by-Digit Architecture for Cube Root
LAMBERTI, FABRIZIO;MONTUSCHI, PAOLO
2008
Abstract
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.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1676191
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo