.png){kind=icon}
.png){kind=icon}
Return
Power Efficient Division and Square Root Unit
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2012.82.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Although division and square root are not frequent operations, most processors implement them in hardware to not compromise the overall performance. Two classes of algorithms implement division or square root: digit-recurrence and multiplicative (e.g., Newton-Raphson) algorithms. Previous work shows that division and square root units based on the digit-recurrence algorithm offer the best tradeoff delay-area-power. Moreover, the two operations can be combined in a single unit. Here, we present a radix-16 combined division and square root unit obtained by overlapping two radix-4 stages. The proposed unit is compared to similar solutions based on the digit-recurrence algorithm and it is compared to a unit based on the multiplicative Newton-Raphson algorithm.
Keywords:
Floating point
division
square root
digit-recurrence
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K