Abstract:
A method and apparatus for determining the trailing bit position from a two operand addition is described. The determination of the trailing bit occurs in parallel with the addition. The two operands are encoded together and the encoded word used to determine the trailing bit position. As the operations of encoding the operands and operating upon the encoded operands require no more time than known methods to determine the trailing bit position after the addition is completed, and as the encoding and operating on the encoded words occurs in parallel with the addition operation, the present invention allows faster processing in the floating point unit.

Description:
FIELD OF THE INVENTION 
     This invention is in the field of digital computing. It specifically relates to floating point arithmetic units (&#34;FPU&#34;s) and their operation. 
     BACKGROUND OF THE INVENTION 
     In a traditional FPU, a sum is computed and then the position of the trailing bit is detected by operating on the calculated sum. The trailing bit position is used to round off the calculated sum. This known method requires waiting for the addition of the two operands to be completed before starting the process of detecting the trailing bit. 
     For example, if operands A and B are added, the result of A+B must be rounded off and normalized. If the final result is defined as a single precision number, a 23 bit number must be stored. If the result is defined as a double precision number, then 52 bits must be stored. In either case, the result of the addition must be rounded off by the appropriate amount. As the interim result is shifted to obtain a final result of the correct length, some of the least significant bits may be discarded, with a consequent loss of precision in the final result. The term &#34;sticky&#34; means those bits which are discarded during a rounding operation. In any rounding operation, the least significant bit of the mantissa is followed by a guard bit, a rounding bit, and then the &#34;sticky&#34;. If any bit position within the sticky contains a &#34;1&#34;, then the value of the sticky is 1 and some loss of precision has occurred in the rounding process. If none of the bit positions within the sticky contains a &#34;1&#34;, then the value of the sticky is zero and no loss of precision occurs with the rounding process. 
     In all cases where rounding is required, the process uses staged OR gates. Using these staged OR gates either to determine the sticky or to discard bits takes time. In particular, as the shifting and determination of sticky occur after the addition of the operands is complete, the determination of sticky is a time intensive operation. 
     SUMMARY OF THE INVENTION 
     The present invention provides a method and apparatus for anticipating the trailing bit of the result bus before the actual result is available from the FPU. The trailing bit anticipator determines the exact position of the least significant bit of the result, while that result is still being calculated in the FPU. The present invention thus converts a serial set of operations into a parallel set, increasing the overall performance of the FPU. 
     The trailing bit anticipator works by encoding the input operands together. The resulting encoded word is then manipulated to yield a binary sticky word using a second encoding scheme which does not involve carry propagation. The final binary sticky word has a trailing one in exactly the same position as the result from the addition operation will have, when complete. The encoding of the input operands and operating on the encoded operands requires approximately the same amount of time as determining the trailing bit using conventional methods. However, in the present invention, these operations occur in parallel with the addition operation. 
     The present invention will now be described in detail with reference to the figures listed and described below. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 illustrates normalizing a number; 
     FIG. 2 is a block diagram of a known adder/shifter combination; 
     FIG. 3 is a block diagram of the multi-stage OR gates needed to generate the shift amount for the circuit of FIG. 2; 
     FIG. 4 is a block diagram of a first embodiment of the present invention; 
     FIG. 5 is a table showing how the binary operands are encoded by the present invention; 
     FIG. 6 is a table illustrating the special case of how the encoded least significant bit and the carry-in are translated into a binary sticky word output; 
     FIG. 7 is a table showing how the encoded characters generate a binary output character; and 
     FIG. 8 is an example showing how the present invention operates. 
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
     FIG. 1 provides an example of an un-normalized positive number 15 stored in a known &#34;2s complement&#34; format. This method of storing numbers uses a sign bit to indicate whether the number is positive or negative. A &#34;0&#34; sign bit indicates a positive number and a &#34;1&#34; sign bit indicates a negative number. To form a negative number using 2s complement, the remainder of the bits in the number after the sign bit are inverted and a &#34;1&#34; added to the result of the inversion. 
     In the environment wherein the present invention operates, numbers are stored as either single or double precision. When stored as a single precision result 25, number 15 has a 23 bit mantissa following the most significant bit (&#34;MSB&#34;), a guard bit, a round bit, and a 33 bit sticky. As the sticky has several bit positions with a value of &#34;1&#34;, the sticky itself has a value of 1. When stored as a double precision result 35, number 15 has a 52 bit mantissa following the MSB, a guard bit, a round bit, and a 4 bit sticky. In this case, as the sticky has no bit position with a value of &#34;1&#34;, the sticky&#39;s value is 0. 
     The present invention uses the fact that for both positive and negative numbers stored using the 2s complement format, the location of the least significant bit (&#34;LSB&#34;) remains exactly the same. 
     To normalize the result of an addition properly, the MSB must be shifted into the leading bit position, the level of precision, either single or double, must be known and the position of the last &#34;1&#34; in the result must be determined. 
     The sign bit in the result before normalization indicates if the number is positive or negative. If the sign bit is &#34;1&#34;, the number is negative. If the sign bit is &#34;0&#34;, then the number is positive. After this information is obtained, the result is shifted until a &#34;1&#34; is in the MSB position, if the number is positive. If the number is negative, it is shifted until a &#34;0&#34; is in the MSB. At this point, the result consists of a mantissa, a guard bit, a round bit, and a sticky. The value of knowing where the last &#34;1&#34; is, whether in the mantissa or sticky, is that it determines how to round the result based on defined I.E.E.E. rounding modes. 
     FIG. 2 illustrates a known system for determining the sticky after an addition is performed. Operands A and B are provided to adder 51. The result of the addition is placed in shifter 53. After determining whether the number is positive or negative and whether it is a double or single precision result, the result is shifted the necessary amount. The sticky is applied to a series of OR gates 55 to determine its value. 
     FIG. 3 provides additional detail of how OR gates 55 would be arranged in an actual system. In a worst case scenario, where the result of A+B is much smaller than a successive operand C, which will be added to the result, it is possible that the entire result of A+B must be shifted out. The delay imposed by so many successive, coupled OR gates is substantial. 
     A first embodiment of the present invention is shown in FIG. 4. It comprises adder 61, shifter 63, leading bit anticipator 65, and trailing bit anticipator 67. Adder 61 receives as input operands A and B and provides the result to shifter 63. Both adder 61 and shifter 63 are known in the art and their construction and operation would be obvious to one of ordinary skill in the art. Leading bit anticipator 65 generates the leading bit of the result prior to the completion of the addition operation within adder 61. Its design and operation, however, is not relevant to the discussion herein of trailing bit anticipator 67. 
     As shown in FIG. 4, operands A and B are provided to trailing bit anticipator 67 at the same time they are provided to adder 61. The two operands are encoded within trailing bit anticipator 67 for further processing. The two operands are fed simultaneously into a simple logic circuit within the anticipator that uses the values in the same bit position in both operands to generate a &#34;K&#34;, &#34;P&#34; or &#34;G&#34;. This type of encoding is known and a table of it is provided by FIG. 5. Thus, if bit position A N  and B N  are respectively &#34;1&#34; and &#34;1&#34;, the encoded value is &#34;G&#34;. If bit positions A N  and B N  are both &#34;0&#34;, the resulting encoded value is K. Finally, if bit positions A N  and B N  have different values, the resulting encoded value is P. 
     Once the encoded word is obtained from the logic circuit, the binary sticky word can be derived from the encoded word. Using first the carry-in value and the least significant position of the encoded word, the combination yields a binary value according to the table shown in FIG. 6. For example, if the encoded bit is either K or G and the carry-in bit is &#34;1&#34;, then the final binary sticky word bit is 1. For all other combinations of encoded bit values and carry-in values, the binary sticky word bit is 0. 
     After using the carry-in bit value and the least significant encoded bit value to generate the least significant bit value of the binary sticky word, the least significant encoded value and the next successive encoded value are combined and a binary sticky word bit is generated according to the table shown in FIG. 7. Thus, for example, if the two encoded values are respectively P and G, the resulting bit value in the binary sticky word would be 1. This continues until a final binary sticky word has been generated. The trailing &#34;1&#34; bit in the binary sticky word will be in the same position as the trailing &#34;1&#34; bit in the actual result of the addition. 
     FIG. 8 illustrates an example of how the present invention would process two operands A and B. For bit positions A 0  and B 0  through A 8  and B 8 , the respective bit positions are encoded using the table shown in FIG. 5. For example, both A 0  and B 0  are &#34;1&#34;. Their encoded value is therefore &#34;G&#34;. The end result of this portion of the process is encoded word 71. 
     Next, the least significant encoded bit position is combined with the carry-in bit to generate the binary sticky word coding. In this case, the carry-in is &#34;0&#34; and the least significant encoded bit is &#34;G&#34;. The resulting binary sticky word bit value is &#34;0&#34;. 
     Finally, for N is 0 to 8, the encoded word positions N and N+1 are combined according to the table shown in FIG. 7. The resulting binary sticky word 73 has a least significant bit in the N 1 , position. The actual result 77 of the addition has a LSB in that same position. 
     The 2 bit combinations that are needed to generate the binary sticky word all occur in parallel, so that there is only a one gate delay in generating the sticky binary word. The only information provided by the sticky word is the position of the LSB. With this third piece of information, however, the proper normalizing can be done. 
     In known systems, determining the LSB position or sticky would require waiting for the adder to add the two operands, another period of waiting until the MSB was shifted into the proper position, and a final waiting period while the bits of the result are ORed together to determine the sticky. In the present invention, there is no need to wait for either the completion of the addition or the shifting. Although in this first embodiment of the present invention a number of OR gates and OR gating is used to generate the final sticky, nothing herein requires such OR gates. Other embodiments of the present invention could scan the sticky word without using such gates.