Design and FPGA implementation of radix-10 combined division/square root algorithm with limited precision primitives

• Published in: 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers pp. 87 - 91
• Main Authors: Ercegovac, Miloš D, McIlhenny, R
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.11.2010
• Subjects: Adders; Algorithm design and analysis; Clocks; Delay; Field programmable gate arrays; Routing; Table lookup
• ISBN: 1424497221; 9781424497225
• ISSN: 1058-6393; 2576-2303
• DOI: 10.1109/ACSSC.2010.5757473

A combined decimal division/square root scheme using limited-precision multipliers, adders, and table-lookups is presented. The combined algorithm, except in the initialization steps, uses a slightly modified digit-recurrence algorithm for division with limited-precision primitives. We describe the proposed combined division/square root algorithm, a design, and its FPGA implementation on a Xilinx Virtex-6 FPGA. We present the cost and delay characteristics for precisions of 7 (single-precision), 8, 14 (double-precision), 16, 24, and 32 decimal digits. The costs range from 1384 to 4066 LUTs with maximum clock frequencies around 68 MHz, and latencies ranging from 102 to 485 ns (with unoptimized routing delays). The proposed scheme uses short (2 to 4 digit-wide) operators which leads to compact modules, and may have an advantage at the layout level as well as in power optimization. The proposed approach is general and can be adapted to other higher radix combined division/square root implementations.