17th IEEE Symposium on Computer Arithmetic (ARITH'05) A Hardware Algorithm for Integer Division Cape Cod, Massachusetts, USA June 27-June 29 ISBN: 0-7695-2366-8
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.2005.6
A hardware algorithm for integer division is proposed. It is based on the digit-recurrence, non-restoring division algorithm. Fast computation is achieved by the use of the radix-2 signed-digit representation. The algorithm does not require normalization of the divisor, and hence, does not require area-consuming leading one (or zero) detection nor shifts of variable-amount. Combinational (unfolded) implementation of the algorithm yields a regularly structured array divider, where pipelining is possible for increasing the throughput. Sequential implementation yields a compact divider.
Citation:
Naofumi Takagi, Shunsuke Kadowaki, Kazuyoshi Takagi, "A Hardware Algorithm for Integer Division," arith, pp.140-146, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||