Optimized integer division circuit
AssigneeOracle International Corporation
InventorsJo C. Ebergen, Dmitry Ju Nadezhin, Christopher H. Olson, Jeffrey S. Brooks
Life of this patent
Estimating the term…
Abstract
The disclosed embodiments relate to the design of an integer division circuit, which comprises: a dividend-input that receives an integer dividend A; a divisor-input that receives an integer divisor B; a quotient-output that outputs an integer quotient q; and a division engine that executes the Goldschmidt method to divide A by B to produce q. During a pre-processing operation, which commences executing before the Goldschmidt method starts executing, the division engine determines whether A<B. If A<B, the division engine sets q=0 without having to execute the Goldschmidt method.
Claims20
An integer division circuit, comprising:
- a dividend-input that receives an integer dividend A;
- a divisor-input that receives an integer divisor B;
- a quotient-output that outputs an integer quotient q;
- and
- a division engine that executes a Goldschmidt method to divide A by B to produce q;
- wherein during a pre-processing operation, which commences executing before the Goldschmidt method commences executing, the division engine determines whether A<B;
- and
- when A<B, the division engine sets q=0 without having to execute the Goldschmidt method.
A system, comprising:
- a processor;
- and
- a memory coupled to the processor;
- wherein the processor includes an integer division circuit, comprising:
- a dividend-input that receives an integer dividend A;
- a divisor-input that receives an integer divisor B;
- a quotient-output that outputs an integer quotient q;
- and
- a division engine that executes a Goldschmidt method to divide A by B to produce q;
- wherein during a pre-processing operation, which commences executing before the Goldschmidt method commences executing, the division engine determines whether A<B;
- and
- when A<B, the division engine sets q=0 without having to execute the Goldschmidt method.
A method for performing an integer division operation, comprising:
- receiving an integer dividend A;
- receiving an integer divisor B;
- performing a pre-processing operation, which commences executing before the method executes a Goldschmidt method, wherein performing the pre-processing operation involves determining whether A<B;
- when A<B, setting the integer quotient q=0 without having to execute the Goldschmidt method;
- if no exception condition arises during the pre-processing operation, executing the Goldschmidt method without modification to produce q;
- and
- outputting q.
Dependencies are inferred from the claim text.