.png){kind=icon}
Return
Division algorithms and implementations
.png){kind=icon}
PRE
AI
DOI：10.1109/12.609274.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many algorithms have been developed for implementing division in hardware. These algorithms differ in many aspects, including quotient convergence rate, fundamental hardware primitives, and mathematical formulations. This paper presents a taxonomy of division algorithms which classifies the algorithms based upon their hardware implementations and impact on system design. Division algorithms can be divided into five classes: digit recurrence, functional iteration, very high radix, table look-up, and variable latency. Many practical division algorithms are hybrids of several of these classes. These algorithms are explained and compared in this work. It is found that, for low-cost implementations where chip area must be minimized, digit recurrence algorithms are suitable. An implementation of division by functional iteration can provide the lowest latency for typical multiplier latencies. variable latency algorithms show promise for simultaneously minimizing average latency while also minimizing area.
Keywords:
computer arithmetic
division
floating point
functional iteration
SRT
table look-up
variable latency
very high radix
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveReynolds numbers exhibit dramatic influence on directionality of movement of self-propelled systems
PREAI
ShareSaveShareSave
View more