By Topic

FPGA Implementations of Radix-10 Digit Recurrence Fixed-Point and Floating-Point Dividers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Baesler, M. ; Inst. for Reliable Comput., Hamburg Univ. of Technol., Hamburg, Germany ; Voigt, S. ; Teufel, T.

In this paper we present three different radix-10 digit recurrence division algorithms for FPGA architectures. The first one implements the simple shift-and-subtract algorithm, whereas the second and third implementations each perform digit recurrence algorithm with signed-digit redundant quotient alculation and carry-save representation of the residuals. However, the second divider computes the quotient digit using a ROM whereas the third divider uses a quotient digit decomposition and requires neither a ROM nor a multiplexer. Furthermore, the fixed-point divider is extended to support IEEE 754-2008 compliant decimal floating-point division for decimal64 data format. Finally, the algorithms have been synthesized on a Xilinx Virtex-5 FPGA and implementation results are given.

Published in:

Reconfigurable Computing and FPGAs (ReConFig), 2011 International Conference on

Date of Conference:

Nov. 30 2011-Dec. 2 2011