Exponential optimization
AssigneeInternational Business Machines Corporation
InventorJohn Robert Ehrman
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorJohn Robert Ehrman
Estimating the term…
An exponential function on a base X raised to a power of N is performed in a processor in a manner that maximizes computing efficiency. The exponential function initially positions at a starting node in an exponential tree stored in a memory of the processor, wherein the starting node represents the value of N. A working value W is created in the memory of the processor and the working value W is initially set equal to the base X. The exponential tree is traversed in the memory of the processor from the starting node to an answer node and the working value W is updated in the memory of the processor at each node encountered during the traversal. The working value is squared in the memory of the processor when a next node is above and to the right of the current node. Otherwise, the working value is squared in the memory of the processor and a result thereof is multiplied by X in the memory of the processor when the next node is above and to the left of the current node. This working value W is finally outputted as a result of the exponential function.
A method of performing an exponential function on a base X raised to a power of N in a processor to maximize computational efficiency, the method comprising the steps of:
An apparatus for performing an exponential function on a base X raised to a power of N in a processor to maximize computing efficiency in the processor, comprising:
An article of manufacture embodying logic for performing an exponential function on a base X raised to a power of N to maximize computational efficiency, the logic comprising the steps of:
A structure stored in a memory for use in performing an exponential function on a base X raised to a power of N to maximize computational efficiency, wherein the structure comprises an exponential tree and the exponential function (a) positions at a starting node in the exponential tree that represents the value of N, (b) creates a working value W in the memory and sets the working value W equal to the base X, (c) traverses the exponential tree in the memory from the starting node to an answer node and updates the working value W in the memory at each node encountered during the traversal, wherein the exponential function squares the working value in the memory when a next node is above and to the right of the current node and the exponential function squares the working value in the memory and multiplies a result thereof by X in the memory when the next node is above and to the left of the current node, and (d) outputs the working value W as a result of the exponential function.
Dependencies are inferred from the claim text.