Construction of a folded leading zero anticipator
AssigneesInternational Business Machines Corporation, Sony Computer Entertainment Inc.
InventorsSang Hoo Dhong, Christian Jacobi, Hwa-Joon Oh, Silvia Melitta Mueller, Yonetaro Totsuka
Life of this patent
Estimating the term…
Abstract
An apparatus, a method, and a computer program are provided for anticipating leading zeros for a Floating Point (FP) computation. Traditional leading zero anticipators (LZA) are typically very wide. To reduce the width of the LZA, it is subdivided to two smaller LZA that compute edge vectors for the most and least significant bits of intermediate resultant vectors. Therefore, a LZA can be easily folded to reduce the area requirement so as to increase the versatility of the LZA.
Claims19
An apparatus for counting leading zeros in a Floating Point (FP) operation, comprising:
- an anticipator that divides at least one intermediate result of the FP operation into a plurality of bit sets and independently anticipates leading zeros for a sum of the at least one intermediate result per set of the FP operation;
- and
- at least one multiplexer (mux) that is at least configured to receive an output from the leading zero anticipator to allow for pre-normalize the FP operation.
A method for counting leading zeros in a FP operation, comprising:
- computing a first edge vector from a set of most significant bits of at least one intermediate results of the FP operation from a first module;
- computing a second edge vector from a set of least significant bits of the at least one intermediate results of the FP operation into a second module;
- and
- pre-normalizing the FP operation if the first edge vector comprises all zeros.
A computer program product for counting leading zeros in a FP operation, the computer program product having a medium with a computer program embodied thereon, the computer program comprising:
- computer code for computing a first edge vector from a set of most significant bits of at least one intermediate results of the FP operation from a first module;
- computer code for computing a second edge vector from a set of least significant bits of the at least one intermediate results of the FP operation into a second module;
- and
- computer code for pre-normalizing the FP operation if the first edge vector comprises all zeros.
Dependencies are inferred from the claim text.