Floating-point division algorithms for an x86 microprocessor with a rectangular multiplier

Floating-point division is an important operation in scientific computing and multimedia applications. This paper presents and compares two division algorithms for an x86 microprocessor, which utilizes a rectangular multiplier that is optimized for multimedia applications. The proposed division algorithms are based on Goldschmidt’s division algorithm and provide correctly rounded results for IEEE 754 single, double, and extended precision floating-point numbers. Compared to a previous Goldschmidt division algorithm, the fastest proposed algorithm requires 25% to 37% fewer cycles, while utilizing a multiplier that is roughly 2.5 times smaller.

• Type: Conference
• Year: 2007
• Where: ICCD
• Authors: Michael J. Schulte, Dimitri Tan, Carl Lemonds
• Keywords: Division Algorithm, Fastest Proposed Algorithm, Floating-point Division, Hardware, ICCD 2007