Abstract:
A floating point processor comprises a first arithmetic unit that adds to or substracts from a first fraction of a first floating point member, a second fraction of a second floating point member. The second number has a weight of corresponding bits equal to that of the first floating point number by being right shifted. The exponent of the second number is less than that of the first number. A second arithmetic unit performs the same adding or substracting operation that the first arithmetic unit performs on the first fraction and the sum of the second fraction and adds the resultant to &#34;1&#34;. An inverter reverses every bit derived by the second arithmetic unit. Outputs of the first and second arithmetic units and inverter are supplied to a selector.

Description:
BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     This invention generally relates to an arithmetic processor and more particularly to an improved floating point processor which can perform arithmetic operation on the fraction of a floating point number, obtain the absolute value of the result of the operation and round the result of the operation at high speed by using a small number of circuit elements. 
     2. Description of the Related Art 
     Ordinary floating point operation is performed by a processor having typical construction as shown in FIG. 1. In this figure, reference characters XI, Ex and Fx indicate input data, an exponent part (hereunder sometimes referred to simply as an exponent) and a fraction part (hereunder sometimes referred to simply as a fraction) of the input data, respectively. Further, reference characters YI, Ey and Fy denote another input data, an exponent part and a fraction part of the input data YI, respectively. Moreover, reference characters Z0, Er and Fz indicate output data, an exponent part and a fraction part of the output data, respectively. Furthermore, reference numerals 500 and 501 indicate a processor for arithmetic operation of a fraction and an exponent comparator, respectively. Reference numerals 502, 503 and 504 indicate selection circuits. Furthermore, 505, 507, 509 and 510 indicate a shifter, an adder, a rounding circuit and a normalization circuit, respectively. Additionally, reference numerals 506 and 508 indicate complement data generators. 
     The operation of a conventional processor illustrated in FIG. 1 is now described in detail. First, the exponent parts Ex and Ey of the input data XI and YI are compared by the exponent comparator 501 by subtracting one of these exponent parts from the other thereof. Further, the selection circuits 502 and 503 are controlled such that the fraction part of the input data, of which the exponent part is less than that of the other data, of the parts Ex and Ey is inputted into the shifter 505 and on the other hand that of the other of the input data XI and YI is inputted into the complement data generator 506. Moreover, the selection circuit 504 is controlled such that the larger one of the exponent parts Ex and Ey is inputted into the normalization circuit 510. The absolute value of the difference between the exponent parts Ex and Ey is then inputted into the shifter 505. Next, the fraction inputted into the shifter 505 is shifted to right by the number of digits corresponding to the difference between the exponent parts Ex and Ey and the weight of corresponding bits of two fraction parts Fx and Fy are made equal to each other. At this time, additional three bits are obtained from the bits &#34;crowded out of&#34; the shifter 505 from the right end thereof by the shift of digits to right therein. The most significant bit of these three bits is called &#34;a guard bit&#34; and is the most significant one of the &#34;crowded out&#34; bits. The second most significant bit of the additional three bits is called &#34;a round bit&#34; and is the second most significant one of the &#34;crowded out&#34; bits. The least significant bit of the three bits, called &#34;a sticky bit&#34;, is obtained by the logical OR of the remaining one of the &#34;crowded out&#34; bits. These three bits are added to the least significant bit of the fraction part supplied to and shifted in the shifter 505 below the least significant bit thereof and are used to round the numerical value of the result of the arithmetic operation. Thereafter, if the arithmetic operation as to the fraction is addition, the fraction outputted from the selection circuit 502 is further outputted by the complement data generator 506 to the adder 507 as it is. On the other hand, if the arithmetic operation relating to the fraction is subtraction, the two&#39;s complement of the fraction outputted is generated and then outputted by the complement data generator 506 to the adder 507. Further, the fractions, of which the weight of corresponding bits are made equal to each other, are added by the adder 507. Then, in order to obtain the absolute value of the result of the addition of the fractions, in case that the result of the addition effected by the adder 507 is positive, the result of the addition is outputted by the complement data generator 508 to further output the rounding circuit 509 as it is. On the other hand, if the result of the addition is negative, the two&#39;s complement of the result of the addition effected by the adder 507 is generated and further outputted to the rounding circuit 509 by the complement data generator 508. In the rounding circuit 509, the value of the result of the arithmetic operation of the fraction received from the generator 508 is rounded. Finally, the value resulted from the above described arithmetic operations of the fractions (hereunder referred to simply as &#34;the interim or temporary result&#34;) is shifted to right or left by the number of digits required to the normalization thereof by the normalization circuit 510. Thereafter, in case that the &#34;interim result&#34; is shifted to right, the amount of the shifted number of digits is added to the exponent inputted to the normalization circuit 510. Further, in case that the &#34;interim result&#34; is shifted to left, the amount of the shifted number of digits is subtracted from the exponent inputted to the normalization circuit 510. Moreover, floating point overflow or floating point underflow is detected by judging whether or not the result of this operation of the exponent exceeds a predetermined range. If not detected, the result of this operation is outputted as it is,. Contrarily, if detected, the result of this operation is modified and thus the process of the above described operations is completed. 
     As above stated, in order to obtain the absolute value of the fraction, the output of the adder 507 is inputted to the rounding circuit 509 as it is if the output of the adder 507 is positive. Further, if negative, two&#39;s complement of the output of the adder 507 is to be generated and further outputted to the rounding circuit 509. Practically, the generation of the two3 s complement by this complement data generator 508 is effected by logically inverting each bit of the input data and further adding 1 to the least significant bit of the inverted input data. Accordingly, the conventional arithmetic circuit has a drawback that if the result of the arithmetic operation such as the addition of the fractions is negative, two&#39;s complement is to be generated and thus it takes such of the operation time and further the configuration of the circuits is complex. 
     Furthermore, in the arithmetic circuit, on completion of the addition of the fractions, the rounding of the result of the addition is effected by the rounding circuit 509. In this rounding operation, the digit to be rounded should be detected in the results, of which the absolute value is obtained, of the arithmetic operation and further a carry generated by the rounding should be added to the detected to digit. Thus, the prior art arithmetic circuit has a defect that in such a case, the rounding operation cannot be started unless the absolute value of the result of the arithmetic operation is determined and that it takes much of the operation time to round the result of the arithmetic circuit and the complex circuit is required for the rounding operation. 
     Further, the exponent comparator 501 is a circuit for comparing the two input data with each other, detecting the relation in magnitude between the two input data and obtaining the absolute value of the difference in magnitude between the two input data. Concurrently, the exponent comparator 501 subtracts a second input data from a first input data and judges from the overflow whether the result of the subtraction is positive or negative. Further, the exponent comparator 501 outputs the result of the subtraction as it is if the result of the subtraction is positive. If negative, the comparator 501 outputs two&#39;s complement of the result of the subtraction is outputted to obtain the value of the result when the sign of the value is reversed. The generation of the two&#39;s complement is concretely effected by logically reversing each bit of the input data and adding 1 to the lest significant bit of the logically reversing data. Thus, if the result of the subtraction is negative, an operation of further adding 1 to the result thereof is additionally required. Therefore, the conventional arithmetic circuit has another drawback that it takes much time to obtain the absolute value of the difference and further the adder as well as the subtracter is needed so that the arithmetic processor becomes large in size. 
     Further, in the normalization circuit 510, a floating point underflow and a floating point overflow are detected. According to IEEE 754 Floating Point Arithmetic Standard, the number of digits of exponent part is determined to be 8 is case of single precision; 11 in case of double precision; and 15 in case of extended double precision, respectively. Further, the range of the exponent of the ordinary normalized floating point data Exp is as follows: 
     
         O&lt;Exp&lt;2.sup.n -1 
    
     where n is the number of digits in an exponent. 
     If the arithmetic operation of the exponent results in that Exp ≦0, a floating point underflow occurs. Further, if Exp ≧2 n  -1, a floating point overflow occurs. Namely, it is necessary to determine the range of the result of the operation of the exponent. Thus, the conventional arithmetic processor has still another drawback that if a floating point underflow or floating point overflow is detected after the exponent correction operation accompanied by the normalization of the fraction is fully completed, the output of the detection signal is delayed. 
     SUMMARY OF THE INVENTION 
     The present invention is accomplished to eliminate the above described drawbacks of the conventional arithmetic processor. 
     It is, accordingly, a first or primary object of the present invention to provide an arithmetic processor which can perform arithmetic operation on fractions, obtain the absolute value of the result of the arithmetic operation and round the result at high speed in floating point operation by using circuit elements which are smaller in number than that of the circuit elements of the prior art processor. 
     Further, it is a second object of the present invention to provide an arithmetic processor which can output the absolute value of the difference between two data at high speed by using circuit elements which are smaller in number than that of the circuit elements of the prior art processor. 
     Moreover, it is a third object of the present invention to provide an arithmetic processor which ca perform the arithmetic operation of exponents and detect a floating point overflow and a floating point underflow at high speed in the floating point operation by using circuit elements which are smaller in number than that of the circuit elements of the prior art processor. 
     Furthermore, it is a fourth object of the present invention to provide an arithmetic processor which can detect the relation in magnitude between two data at high speed. 
     In accordance with one aspect of the invention, a floating point processor responsive to input floating point numbers for performing floating point arithmetic operations on the input floating point numbers comprises a first arithmetic means for adding to or subtracting from a first fraction of a first floating point number, a second fraction of a second floating point number having a weight of corresponding bits equal to that of the first floating point number. The first number has an exponent larger than the exponent of the other floating point number. The second fraction is right shifted so that exponent is less than that of the first floating point number. The result of the addition or the subtraction is derived by the first means as a first output. A second arithmetic means performs the same adding or subtracting operation as the first arithmetic means performs on the first fraction and the sum of the second fraction and adds &#34;1&#34; to the resultant to derive a second output. An inverting means reverses every bit of the output of the second arithmetic means. A result selecting means selects the arithmetic operation from the outputs of the first and second arithmetic means and the inverter means. 
     According to another aspect of the invention, a floating point processor responsive to input floating point numbers for performing floating point arithmetic operations on the input floating point numbers comprises a carry generation and progagation producing means for (a) performing a first operation wherein a first fraction of a first floating point number, having an exponent larger than the exponent of the other floating point number, is added to or subtracted from a second fraction of a second floating point number having (i) a weight of corresponding bits equal to that of the first floating point number by being right shifted and (ii) an exponent less than that of the first floating point number, (b) deriving a first output that is the result of the addition or the subtraction of the first operation (c) performing the same adding or subtracting operation as performed on the first fractions and the sum of the second fraction during the first operation and adding one to the resultant and (d) deriving a second output that is the result of (c). An inverting means reverses every bit of the second output. A result selecting means selects the resultants of the arithmetic operations from the outputs of the carry generation and propagation producing means and the inverting means. 
     According to a further aspect of the invention, a floating point processor responsive to input signals representing floating point numbers for performing floating point arithmetic operations on the floating point numbers represented by the input signals comprises a first arithmetic means for linearly combining first and second signal values respectively representing first and second fractions of first and second floating points numbers. The first fraction has an exponent larger than the exponent of the other floating point number. The first arithmetic means shifts a second fraction of a second floating point number to cause the weight of corresponding bits of the second number to equal that of the first floating point number and (ii) the exponent of the second number to be less than that of the first floating point number. The first arithmetic means derives a first output signal representing the result of the linear combining of the first and second signal values. A second arithmetic means performs the same linear combining operation as the first arithmetic means performs on the first fraction and the sum of the second fraction and adds the resultant with &#34;1&#34; to derive a second output signal. An inverting means reverses every bit of the second output signal. A result selecting means selects the arithmetic operation from the output signals of the first and second arithmetic means and the inverting means. 
     According to still another aspect of the invention, a floating point processor responsive to input signals representing floating point numbers for performing floating point arithmetic operations on floating point numbers represented by the input signals comprises a carry generation and propagation producing means for linearly combining first and second fractions of first and second floating point numbers. The first fraction has an exponent larger than the exponent of the other floating point number. The second floating point number has a weight of corresponding bits equal to that of the first floating point number and an exponent less than that of the first floating point number. A first output signal representing the result of the linear combining of the first and second fractions is derived. The same linear combining operation as performed on the first fraction and the sum of the second fraction is added to &#34;1.&#34; A second output signal representing the result of the operation performed on the first fraction and the sum of the second fraction and &#34;1&#34; is derived. An inverting means reverses every bit of the second output signal. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     Other features, objects and advantages of the present invention will become apparent from the following description of preferred embodiments with reference to the drawings in which like reference characters designate like or corresponding parts throughout several views, and in which: 
     FIG. 1 is a block diagram of a conventional arithmetic processor for performing floating point operation; 
     FIG. 2 is a block diagram of a first embodiment of the present invention; 
     FIG. 3 is a truth table of a &#34;carry for rounding&#34; signal at an addition effected in the first embodiment of the present invention; 
     FIG. 4 is a truth table of a &#34;carry for rounding&#34; signal at a subtraction effected in the first embodiment of the present invention; 
     FIG. 5 is a diagram of the logic circuit of the first embodiment of the present invention implemented by employing CMOS circuits; 
     FIG. 6 is a block diagram showing a second embodiment of the present invention; 
     FIG. 7 is a diagram of the logic circuit of the second embodiment of the present invention implemented by employing CMOS circuits; 
     FIG. 8 is a block diagram of a third embodiment of the present invention; 
     FIG. 9 is a diagram of the logic circuit of the third embodiment of the present invention implemented by employing CMOS circuits; and 
     FIG. 10 is a block diagram of a fourth embodiment of the present invention. 
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the drawings. 
     FIG. 2 is a block diagram of a first preferred embodiment of the present invention. In this figure, reference numerals 501, 502, 503, 504, 505 and 510 indicate circuits similar to those indicated by the same reference numerals in FIG. 1, respectively. Circuit 100 performs arithmetic operations on fractions of data which acts as the circuit 500 for performing the arithmetic operations on the fractions shown in FIG. 1; 101 a carry generation and propagation producing circuit; 102 a &#34;carry for rounding&#34; generation circuit; 103 and 104 sum and difference generating circuit; 105 an reversing or inverting circuit; and 106 indicates a &#34;result selection signal&#34; generating circuit; 107 a selection circuit. Moreover, reference characters X indicates a fraction of data having a large exponent (hereunder referred to as an operand); Y a fraction of data having a small exponent and shifted to right (hereunder referred to as an operand); GRS a guard bit, a round bit and sticky bit (hereunder referred to simply as GRS) of the operand Y; MSUB a subtraction signal; and Z indicates the result of the operations including rounding and obtaining the absolute value of data. 
     First, an operation of the arithmetic circuit 100 for effecting an arithmetic operation on a fraction of FIG. 100 will be described hereinbelow. When the operand X and the operand Y are inputted into the carry generation and propagation producing circuit 101, a carry signal C 0  108 generated at each digit in case of addition of the fractions X and Y is obtained and another carry signal C 0  109 generated at each digit in case of adding the fractions X and Y when there is a carry of 1 added to the least significant bit is also obtained. On the other hand, if the arithmetic operation on the fractions is subtraction, a barrow signal C 0  108 generated at each digit in case of subtracting the fraction Y from the fraction X, as well as a borrow signal C 1  109 generated at each digit in case of subtracting the fraction Y from the fraction X when there is a borrow of 1 to the least significant bit, is obtained. Further, the borrow signals C 0  108 and C 1  109 are added to the sum and difference circuits 103 and 104. respectively. The signals C 0  and C 1  will be referred to as carry signals hereafter. The carry generation circuits for generating these carry signals can be constructed such that the most part of one of the carry generation circuits is in common with each other. Moreover, in the carry generation and propagation producing circuit 101, an intermediate sum S of the outputs of the exclusive OR of each pair of corresponding bits of the fractions X and Y is obtained. Furthermore, the &#34;carry for rounding&#34; generation circuit 102, part of each of the operand X and the operand Y, as well as GRS, is inputted to the &#34;carry for rounding&#34; generation circuit 102, whereupon is obtained a &#34;carry for rounding&#34; signal 111 indicating a &#34;carry for rounding&#34;, that is, a carry (a borrow (in case of subtraction)) to a digit corresponding to the least significant bit of the carry generation and propagation producing circuit 101, which carry is generated at a digit where rounding is effected in operations on X and Y and GRS. Further, the &#34;carry for rounding&#34; signal 111 is inputted to the result selecting signal generation circuit 106. Next, the sum and difference generating circuit 103 (or 104) evaluates the result 112 (or 113) of an operation on the fractions X and Y, that is, (X±Y) (or X±(Y+1) in case that a carry or borrow has occurred to the least significant bit) from the carry signals C 0  108 (or C 1  109) and the exclusive OR of each pair of the corresponding bits thereof at each digit, which are obtained in the carry generation and propagation producing circuit 101. The results of the operations are inputted to the selection circuit 107. Only the result 113 of the operation X±(Y+1) is also inputted to the inverting circuit 105. The data at two bits 114 and 115 of higher order including the overflows occurred in the results of these operations are inputted to the result selecting signal generation circuit 106. Further, the inverting circuit 105 evaluates the result 116 of the operation X±(Y+1) by reversing each bit of the result 113 of the operation X±(Y+1). The obtained result 116 of the operation X±(Y+1) is added to the contents of the selection circuit 107. Furthermore, the value of the result 116 of the operation X±(Y+1) is equal to the value of -(Y--Y) obtained by reversing the sign of the X--Y in case the arithmetic operation is a subtraction. Finally, a selection signal 117 for selecting an appropriate result from the results 112, 113 and 116 is generated in response to the &#34;carry for rounding&#34; signal 111 obtained in the &#34;carry for rounding&#34; signal generation circuit 102, the two bits 114 and 115 of higher order of the result of the operation and the subtraction signal MSUB. The appropriate result is selected by the selection circuit 107 and further the result Z of the arithmetic, rounding operations and obtaining the absolute value thereof is outputted. 
     Next, each of the circuits will now be specifically described. First, the carry generation and propagation producing circuit 101 is a circuit for obtaining a carry C 0  generated at each digit in case of the addition or subtraction of two data X and Y inputted to this circuit and another carry C 1  generated at each digit in case of the addition or subtraction of the two data X and Y when there is a carry in the least significant bit. 
     In the following description, the number of digits of inputted data is assumed to be n (n is a positive integer) and the input data X and are assumed to be as follows: 
     
         X=x.sub.n-1 . . . X.sub.1 X.sub.o ; and 
    
     
         Y=y.sub.n-1. . . y.sub.1 y.sub.o. 
    
     First, a carry generation function g i ,j and a carry propagation function p 1 ,j will be described hereinbelow. Here, it is assumed that i≧j. Further, g i , j means that if an addition or a subtraction is effected from the j-th to the i-th bit, a carry or a borrow to a bit of higher order is generated. On the other hand, p i , j means that if an addition or a subtraction is effected from the j-th to the i-th bit, a carry or a borrow is propagated to a higher order bit when a carry or a borrow from a bit of lower order occurs. (Hereunder, for simplicity of description, only the term &#34;carry&#34; is used in the description even in case that it is applicable to a borrow.) From these definitions, the carry generation function g i ,j and the carry propagation function p i ,j of each digit are given by using the values x i  and y i  of each digit of the input data as follows: ##EQU1## where MSBU indicates a subtraction signal of which the value is &#34;1&#34; in case that the arithmetic operation to be effected is subtraction and &#34;0&#34; in case that the arithmetic operation to be effected is addition. As described above, p i ,i can be represented by either of the representations (2a) and (2b). This is because, if a carry from a digit concerned to a higher order digit is generated, there are two cases that a carry is included in the carry propagation and that a carry is not included in the carry propagation. Either of these representations can be used in generating a carry. 
     In case where i≧j≧k, the following equations hold for such i, j and k: 
     
         g.sub.i, ki =g.sub.i,j +p.sub.i, j ·g.sub.j-l,k   (3) 
    
     
         p.sub.i, k =p.sub.i, j ·p.sub.j-i, k              (5) 
    
     From these equations (1) thru (4) above, the carry generation functions g i , k and the carry propagation functions p i , k from the k-th digit, which is a reference digit, to the i-th digit can be obtained. That is, the values of the carry generation function g i , i and the carry propagation function p i , i of each digit itself as represented by the equations (1) and (2) are first obtained from the data of each digit at which an operation is performed. Further, the carry generation function and the carry propagation function of each of the digits from a reference digit to a concerned digit can be obtained by iteratively applying the equations (3) and (4). Taking addition or subtraction performed at each of the bits from the reference bit to the concerned bit into considerations by using the above-described definitions of the carry generation function and the carry propagation function, the carry generated at the i-th digit is given by the following equation: 
     
         c.sub.i =g.sub.i,j +p.sub.i,j ·c.sub.j-i          (5) 
    
     Moreover, in case where j=0 in the equation (5), the carry is given by 
     
         c.sub.i =g.sub.i,o +p.sub.i,o ·c.sub.-1           (6) 
    
     where c -i  indicates a carry to the least significant digit. If c -i  is &#34;0&#34;, a carry c 0   1  from each digit in the operation X±Y can be obtained. Further, if c -1  is &#34;1&#34;, a carry c 1   i  from each digit in the operation X±(Y+1) can be obtained. In the configuration of circuits for generating carry signal C.sup.□ and C 1 , the parts for generating the carry generation function g i ,j and the carry propagation function p i , j can be implemented by the same circuit and thus the most part of the circuits is used in common. Therefore, only the parts for generating the carries are made independently with each other. Further, in the carry generation and propagation producing circuit 101, the interim or temporary sum S is obtained by computing the exclusive OR of each pair of the corresponding bits of the input data X and Y. Namely, the i-th bit s 1  of the interim sum S is represented by 
     
         s.sub.I =x.sub.I ⊕y.sub.I                              (7) 
    
     This interim sum S i , as well as the carries C 0   1  and C 1   1  is used to evaluate a final sum of the operation. 
     Next, the sum and difference generating circuits 103 and 104 are described in detail. These circuits are used to obtain the results of the arithmetic operations (X±Y) and {X±(Y+1)} from the carries C 0  and C 1  generated at the time of operations of the input data X and Y and the interim sum S. For example, the i-th bit z 0   i  of the result of the operation (X±Y) is obtained by the following equation from the carry c 0   i-1  in case that the carry c -1  to the least significant digit is &#34;0&#34;. ##EQU2## Moreover, the i-th bit z 1   i  of the result of the operation X ±(Y±1) is obtained by the following equation from the carry c 1   i-1  to the i-th digit in case the carry c -1  to the least significant bit is &#34;1&#34;. ##EQU3## 
     Furthermore, the &#34;carry for rounding&#34; generation circuit 102 will now be described in detail. This circuit is used to obtain a &#34;carry for rounding&#34; signal 111, that is, a signal indicating a carry to a digit corresponding to the least significant bit of the carry generation and propagation producing circuit 101 which signal is generated when the addition (or subtraction) and the rounding is performed at the digit, at which the rounding is to be effected, in the operation on the input data including X, Y and GRS in response to signals indicating part of lower order bits of the input data X and Y and GRS. 
     The rounding will now be described. The operand X is the fraction of the input data of which the exponent is larger than that of the other data Y and the value of the normalized fraction. Therefore, there are two digit positions at which the rounding may be effected when the addition is performed. That is, one of the digits is the digit place where no overflow results from the addition and the other is the digit place where an overflow results from the addition. When no overflow occurs, the rounding is to be effected at the digit place one bit below the least significant bit of the input data X that is, at the guard bit. On the other hand, when an overflow occurs, the rounding is to be effected at the least significant bit of the data X. Similarly, in case of subtraction, there are two digit positions where rounding may be performed. In case no overflow occurs in the result, that is, the result of the subtraction is positive and the most significant bit of the subtraction result is 1, rounding is performed at the guard bit. Further, if the result of the subtraction is positive and the most significant bit of the result is 0, rounding is performed at the round bit. At that time, there is a case that more than one digit from the most significant bit of the result in 0. Such result of the subtraction is obtained only in case the data exponents are equal to each other or different by one and thus the values at the digit places, which are the same with or below the round bit, are 0. Therefore, in such a case, the processor has only to round the data at the round bit. There is another case of an overflow occurring in the subtraction result, that is, the subtraction result is negative. This occurs only if the data exponents are equal. Thus, the values at the digit places, which are the same with or below the guard bit, are 0. Therefore, in such a case, there is no need to round. As can be understood from the foregoing description, there are three digit places (hereunder sometimes referred to simply as &#34;digit places for rounding&#34;), where rounding is to be performed, (1) in the addition and subtraction operations that is, the least significant bit of the result, (2) the guard bit and (3) the round bit. There are several rounding methods. For instance, four modes of rounding, that is, &#34;rounding to nearest&#34;, &#34;round toward +∞&#34;, &#34;round toward -∞&#34; and &#34;round toward 0&#34; are prescribed in the IEEE 754 Floating Point Arithmetic Standard. Therefore, the processor must only obtain the &#34;carry for rounding&#34; signals corresponding to the &#34;digit places for rounding&#34; and the modes of rounding. For example, the &#34;round to nearest&#34; mode, the mode often employed in the processor, is described in detail herein. The &#34;round to nearest&#34; method is devised such that the result of rounding the data according to this method becomes nearest to the accurate result. Thus, if there are two values nearest to the accurate result, the least significant bit of the result of the rounding pursuant to this method is set to be 0. If the &#34;carry for rounding&#34; is that to the least significant bit of the data X, the &#34;carry for rounding&#34; according to this method is effected by using the truth table of FIG. 3 in case of addition, or the truth table of FIG. 4 in case of subtraction. In these truth tables, z.sup.□ 1  land Z 0   0  indicate the values of two bits from the least significant bit of the result of the operation on the data X and Y, respectively. Further, y G , y R  and Y S  indicate the values at the guard bit, the round bit and the sticky bit, respectively. Moreover, y R  +y S  indicates the logical OR of y R  and y s . Further, CRU denotes a &#34;carry for rounding&#34; signal corresponding to the rounding effected at the least significant bit, that is, the bit z 0   0  ; CRM another &#34;carry for rounding&#34; signal corresponding to the rounding effected at the guard bit, that is, the bit y G  ; and CRL still another &#34;carry for rounding&#34; signal corresponding to the rounding effected at the round bit, that is, the bit y R . Further, in case of the subtraction, &#34;-1&#34; means a borrow of 1. The &#34;carry for rounding&#34; indicated by the CRU in case of addition is determined such that the result of effecting the rounding at the least significant bit, that is, the bit Z 0  0 coincides with that of effecting the &#34;carry for rounding&#34; to the least significant bit t every bit which is higher order than the bit z 0   1 . Thus, the digit z 0   0  is not necessary as the rounded result and may be either 0 or 1. Therefore, there occur cases (indicated by the asterisks * in FIG. 3) that the value indicated by the signal CRU may be either 0 or 1. As can be understood from these two truth tables, the carry or borrow to the least significant bit, which is caused by the rounding is 1 at most. When the result is positive, the value of the part composed of the bits having the same or higher order than the least significant bit, of the result after rounding can be only the value of the operation X±Y or X±(Y+1). The &#34;carries for rounding&#34; CRU, CRM and CRL in cases of addition and subtraction are obtained from these truth tables as follows: 
     First, in case of addition, 
     
         CRU=x.sub.1 ⊕y.sub.1 +y.sub.G +y.sub.R +y.sub.S        (10) 
    
     
         CRM=y.sub.G (x.sub.0 ⊕y.sub.0 +y.sub.R +y.sub.S)       (11) 
    
     Further, in case of subtraction, 
     
         CRM=y.sub.G (x.sub.0 ⊕y.sub.0 +y.sub.R +y.sub.S)       (12) 
    
     
         CRL=y.sub.G +y.sub.R ·y.sub.S                     (13) 
    
     As can be understood from comparison between the equations (11) and (12), the &#34;carry for rounding&#34; CRM can be represented by the same signal in cases of both of addition and subtraction. Thus, the processor has only to produce only three signals. 
     Next, in case that the result of the subtraction is negative, which occurs only when the two exponents are equal to each other, all of the guard bit, the round bit and the sticky bit are 0 and thus these is not necessity of rounding. The fraction of the result of the operation should be represented by the absolute value thereof and therefore the absolute value of the fraction should be computed when the result of the operation is negative. The value obtained by reversing the sign of the result of the subtraction (X-Y) can be found by evaluating the reverse X-(Y+1) of all of the bits of {X-(Y+1)}. Generally, the value obtained by reversing the sign of data A is computed by obtaining the two&#39;s complement of the data, that is, by reversing all of the digits of the data and further adding 1 to the least significant bit of the data. Namely, the following equation holds in general. 
     
         -A=A+1                                                     (14) 
    
     Thus, by using the relation expressed by the equation (14), the following equation can be modified as follows. ##EQU4## 
     This proves that the value obtained by reversing the sign of the result of the subtraction (X-Y) is found by reversing all of the bits of {Y-(Y+1)}, as above described. The inverting circuit 105 is used to obtain the reverse X-(Y+1) of all of the bits of {X-(Y+1)}. It can be determined by the overflow signal generated at the time of the subtraction on the data X and Y whether or not the result of the subtraction (X-Y) is negative. Namely, if the overflow is 1, the result of the subtraction (X-Y) is negative and as a consequence the circuit 105 has only to output the value of the reverse X-Y(Y+1). On the other hand, if the overflow is 0, the result of the subtraction (X-Y) is positive and consequently the circuit 105 has only to output the value of (X-Y). 
     Finally, the result selecting signal generation circuit 106 will be detailed described hereinbelow. This circuit is provided to generate a signal for selecting the result of an operation on data, of which the absolute value is obtained and rounded, from the outputs of the sum and difference generating circuits 103 and 104 and the inverting circuit 105. First, in case that the output of the inverting circuit 105 is selected, which occurs only when the arithmetic operation on the fractions is subtraction and the value of (X-Y) is negative, that is, the overflow RC 0  of the result of the operation (X-Y) is 1. Thus, a signal SL 2  for selecting the output of the inverting circuit 105 is represented by 
     
         SL.sub.2 =MSUB·RC.sup.0                           (16) 
    
     Further, a signal SL 1  for selecting the outputs {X±(Y+1)} of the sum and difference generating circuit 104 is represented as follows: ##EQU5## where RC 1  and S 1   M  indicate the overflow and the most significant bit of {X±(Y+1)}, respectively. Further, RC 0  and S 0   M  indicate the overflow and the most significant bit of (X±Y), respectively. The equation (17) means the following matters. That is, the operations on the fractions are effected except in case that the output of the inverting circuit 105 is selected. Further, an appropriate one of two round bits is determined on the basis of the overflow signal when rounded at a bit of lower order. When the value indicated by the &#34;carry for rounding&#34; signal corresponding to the appropriate round bit is 1, the result of {X±(Y+1)} is selected. Moreover, by simplifying the equation (17), the following equation is obtained: ##EQU6## 
     Furthermore, the following equations are obtained from the equations (10) to (13): 
     
         CRU·CRM=CRM                                       (19) 
    
     
         CRM·CRL=CRM                                       (20) 
    
     Thus, the equation (18) is further simplified as follows: 
     
         SL.sub.1 =SL.sub.2 ·(CRM+MSUB·RC.sup.0 ·CRU+MSUB·CRL·S.sup.1.sub.M)   (21) 
    
     On the other hand, the signal SL o  for selecting the output (X±Y) of the sum and difference generating circuit 103 is represented as follows: ##EQU7## Further, the logic of the result selecting signals SL 0 , SL 1  and SL 2  can be represented by logic expressions other than the equations (16), (21) and (22). 
     In the above described way, the final result is obtained through the operations on the fractions, the rounding operations and the operations for obtaining the absolute value of the rounded value. The conventional processor of FIG. 1 requires the carry generation and propagation producing circuits each of which includes a large number of circuit elements and is provided for at least each of the adder 507 and the rounding circuit 509, while the processor of the present invention needs only one carry generation and propagation producing circuit and thus can save significantly the circuit elements. Further, the arithmetic processor of the present invention can perform the operations on input data, the rounding of the results of the operations and the operation of obtaining the absolute value of the rounded results by effecting addition or subtraction only one time, thereby performing such arithmetic operations at high speed. 
     FIG. 5 shows the concrete constructions of a logic circuit which is a first preferred embodiment of the present invention, in case that the number of digits of the fraction of the input data is 8. In this figure, reference numeral 201 indicates a carry generation and propagation producing circuit; 202 a &#34;carry for rounding&#34; circuit; 203 and 204 sum and difference generating circuits; 205 an inverting circuit; 206 a result selecting signal generation circuit; and 207 a selection circuit. These circuits 201, 202, 203, 204, 205, 206 and 207 correspond to the circuits 101, 102, 103, 104, 105, 106 and 107 of FIG. 2, respectively. In the logic circuit of FIG. 5, one additional bit z -1  is consequently added to the least significant bit of the data when the result is rounded at the round bit and the subtraction is effected and the most significant bit is 0. The output of this least significant bit is obtained from y G , y R  and y s . In this way, the arithmetic processor of the present invention can be perform arithmetic at high speed by using a small number of logical gate circuits and logical stages. 
     FIG. 6 is a block diagram showing a second preferred embodiment of the present invention. Further, the function of the circuit of FIG. 6 is to output the absolute value of the difference between the inputted two data. In this figure, reference numeral 601 designates a carry generation and propagation producing circuit; 602 and 603 difference generating circuits; 604 an inverting circuit; and 605 a selection circuit. Further, reference characters X and Y indicate inputted data; and Z the output data of the absolute value of (X-Y). 
     Operation of the circuit of FIG. 6 is now described in detail. Input data X and Y are supplied to the carry generation and propagation producing circuit 601. Circuit 601 derives a carry C 0  606 (which is generated for each bit for a subtraction operation on data X and Y), a carry C 1  608 (which is generated for each bit for a subtraction operation on data X and Y when there is a carry of the least significant bit) and an interim sum S representing the exclusive OR of every pair of corresponding bits of data X and Y. In the difference generating circuit 602, the value of (X-Y) is obtained from the carry C 0  606 and the interim sum S. On the other hand, in the difference generating circuit 603, the value of {X-(Y+1)} is evaluated from the carry C 1  608 and the interim sum S. Further, the inverting circuit 604 obtains the value of {X-(Y+1)} by reversing every bit of {X-(Y+1)} obtained by the difference generating circuit 603. This value of {X-(Y+1)} represents the value of -(X-Y) as described as to the equation (15) . The selection circuit 605 selects the output (X-Y) of the difference generating circuit 602 or the output {X-(Y+1)} of the inverting circuit 604 in accordance with the overflow signal 609 outputted from the difference generating circuit 602 and outputs the absolute value of Z (=|X-Y|). If the value indicated by the overflow signal 609 is &#34;0&#34; , the value of (X-Y) is positive and the output (-Y) of the difference generating circuit 602 is selected. On the other hand, if the value indicated by the overflow signal 609, the value of (X-Y) is negative and the output }X-(Y+1)} of the inverting circuit 604 is selected. 
     As above described, the carry generation and propagation producing circuit 101 obtains the carry C 0   generated at each digit in case of effecting the addition or the subtraction operation on the inputted data X and Y and further obtains the carry C 1  generated at each digit in case of effecting the addition or the subtraction operation on the data X and Y. In contrast, the carry generation and propagation producing circuit 601 is used to obtain the carry C 0  generated at each digit in case of effecting the subtraction between the inputted data X and Y and further obtains the carry C 1  generated at each digit in case of effecting the subtraction between the data X and Y when the carry to the least significant bit. Therefore, as is apparent if 1 is substituted for the value indicated by the signal MSUB in the equations (1) and (2), the carry generation and propagation producing circuit 601 is constructed in the manner similar to the construction of the circuit 101 shown in FIG. 2. Further, the difference generating circuits 602 and 603 are constructed in the similar manner as the corresponding circuits shown in FIG. 2. Further, in the foregoing description, the processor of the present invention for outputting the absolute value of the difference have been described. However, by the opposite selection, the processor of the present invention can output the two&#39;s complement of the absolute value of the difference. Moreover, in the foregoing description, the configuration for selecting the result of the operations in accordance with the overflow signal 609 outputted from the difference generating circuit 602 have been described. It is, however, apparent to those skilled in the art that the circuit of the present invention can be altered to effect the similar selection in accordance with the overflow signal outputted from the difference generating circuit 603. 
     FIG. 7 shows the concrete construction of a logic circuit which is a second preferred embodiment of the present invention, in case that the number of digits of the fraction of the input data is 8. In this figure, reference numeral 701 indicates a carry generation and propagation producing circuit; 702 and 703 difference generating circuits; 704 an inverting circuit; 705 a selection circuit; and 709 an overflow signal. These circuits and signal 701, 702, 703, 704, 705 and 709 correspond to the circuits and signal 601, 602, 603, 604, 605, and 609 of FIG. 6, respectively. In the circuit of FIG. 7, the overflow signal 709 is outputted from the carry generation and propagation producing circuit 6701. This is because the signal indicating the carry from the most significant bit is the same with the overflow signal in this circuit. 
     FIG. 8 is a block diagram showing a third embodiment of the present invention. The function of the circuit shown in FIG. 8 is to detect the final normalized result of the operation on the exponents in case of effecting the addition or subtraction of floating point data. In this figure are included carry generation and propagation producing circuit 801; sum and difference generating circuit 802; a floating point underflow detecting circuit 803; and a floating point overflow detecting circuit 804. Further, reference character Em indicates the exponent of one of the floating point data, which is larger than the of the other of the floating a point data; SH the absolute value of the amount of the shift to right or left for the purpose of normalization of the interim result of the fraction; MSUB a subtraction signal; C 1   M  an overflow signal; E o  the result of operations on the exponent; UDF a floating point underflow detecting signal; and OVF a floating point overflow detecting signal. The carry generation and propagation producing circuit 801 and the sum and difference generating circuit 802 are similar in construction to the carry generation and propagation producing circuit 101 and the sum and difference generating circuit 103, respectively. Operation of the embodiment of FIG. 8 is now briefly described. Exponent EM and the amount SH of the shift are inputted to the carry generation and propagation producing circuit 801. Then, subtraction signal MSUB signals whether an addition or subtraction operation is to be performed. The overflow signal C 1   M  of the operation {Em ±(SH+1)}, the carry C 0  to each bit of the operation (Em ±SH) and the interim sum S are obtained. Next, a floating point underflow is detected by the floating point underflow detecting circuit 803 on the basis of the overflow signal C 1   M  and the subtraction signal MSUB when the arithmetic operation to be performed is subtraction and the value indicated by the overflow signal C 1   M  is &#34;1&#34;. If a floating point underflow is detected, the floating point underflow signal UDF is outputted by the circuit 803. Further, a floating point overflow is detected by the floating point overflow detecting circuit 804 on the basis of the overflow signal C 1   M  and the subtraction signal MSUB when the arithmetic operation to be performed is addition and the value indicated by the overflow signal C 1   M  is &#34;1&#34;. If a floating point overflow is detected, the floating point overflow signal OVF is outputted by the circuit 804. Simultaneously, the result of the operation (Em±SH) is obtained using the carry C 0 , which is obtained when the carry C -1  to the least significant is &#34;0&#34;; and outputted as the result E o  of the operation on the exponent by the sum and difference generating circuit 802. 
     Detection of a floating point underflow or a floating point overflow is derived in response to overflow signal C 1   M  and the subtraction signal MSUB. If Em is the exponent of the ordinary normalized floating point data, a floating point overflow and a floating point underflow in every result of arithmetic operations on the floating point data can be detected on the basis of the overflow signal C 1   M . As described above, a floating point overflow occurs when the following relation holds: 
     
         Em+SH≧2.sup.n -1. 
    
     That is, 
     
         Em+SH+1≧2.sup.n. 
    
     Thus, the value at the (n+1)-th bit is and accordingly the value indicated by the overflow signal C 1   M  is &#34;1&#34;. On the other hand, a floating point underflow occurs when the following relation holds: 
     
         Em-SH≦0. 
    
     That is 
     
         Em-(SH+1)≦-1. 
    
     Therefore, in this case, the value at the (n+1)-th bit indicating the sign is and thus the value indicated by the overflow signal C 1   M  is &#34;1&#34;. Thus, when the arithmetic operation to be performed is subtraction and the overflow signal C 1   M  indicates &#34;1&#34;, a floating point underflow is detected and the floating point underflow signal UDF is outputted. Further, when the arithmetic operation to be performed is addition and the overflow signal C 1   M  indicates &#34;1&#34;, a floating point overflow is detected and the floating point overflow signal OVF is outputted. 
     FIG. 9 is a circuit diagram of another preferred embodiment of the present invention implemented by employing CMOS circuits in case that the number of bits of the exponent of the input data is set to be 8, that is, in case of single-precision prescribed in the IEEE 754 Floating Point Arithmetic Standard. In this figure, reference numeral 901 indicates a carry generation and propagation producing circuit; 902 a sum and difference generating circuit; 903 an underflow detecting circuit; and 904 an overflow detecting circuit. Further, the circuits 901, 902, 903 and 904 correspond to the circuits 801, 802, 803 and 804, respectively. Input data includes a part e mi  (0≦i≦7) of 8 bits which is an exponent part and another part sh i  (0≦i≦4) of 5 bits which indicates the amount of shift. Further, the subtraction signal SUB is inputted to the circuit of this embodiment. Moreover, a signal indicating the result e oi  (o≦i≦7) of the operation on the exponent, a floating point underflow signal UDF and an floating point overflow signal OVF are outputted. As described above, the data of the amount of shift has only 5 bits because the result of the operation on the rounded fraction can be represented by 24 bits and thus the amount of shift for normalization can be fully represented by only 5 bits. 
     The arithmetic operation of modifying the exponent and the detection of an underflow and an overflow are performed in the above described manner in this embodiment of the present invention. Thus, only by adding a simple circuit to the device for effecting arithmetic operations on the exponent, this embodiment of the present invention can output the floating point underflow signal and the floating point overflow signal at high speed before the result of the operation on the exponent is obtained. 
     FIG. 10 is a block diagram showing a fourth embodiment of the present invention. The function of the circuit shown in this figure is to detect the relation in magnitude between inputted two data. Further, in this figure, reference numeral 1001 indicates a carry generation and propagation producing circuit; and 1002 and 1003 gates. Moreover, in this circuit, reference character X indicates a minuend of the two input data; Y a subtrahend of the two input data; C 0   M  an overflow signal produced at the time the subtraction (X-Y) in case that the carry to the least significant bit is &#34;0&#34;; C 1   M  an overflow signal produced at the time of the subtraction (X-Y) in case that the carry to the least significant bit is &#34;1&#34;; E a terminal for outputting a detection signal indicating that the input data X and Y are equal to each other; L another terminal for outputting a signal indicating that the data X is less than the data Y; and G still another terminal for outputting a detection signal indicating that the data X is greater than the data Y. The carry generation and propagation producing circuit 1001 and gates 1002 and 1003 of FIG. 10 act in the manner similar to the circuits 101, 103 and 104 of FIG. 2 do, respectively. 
     Next, an operation of this embodiment of FIG. 10 will be briefly described hereunder. First, the minuend X and the subtrahend Y are inputted to the carry generation and propagation circuit 1001. Thereafter, in case that the arithmetic operation is subtraction between the data X and Y and further the carry to the least significant bit is &#34;0&#34;, the overflow signal C 0   M  in case of the subtraction (X-Y) is generated. On the other hand, in case that the arithmetic operation is subtraction between the data X and Y and further the carry to the least significant bit is &#34;1&#34;, the overflow signal C 1   M  in case of the subtraction {X-(Y +1)} is generated. These overflow signals C 0   M  and C 1   M  are obtained in the manner similar to that in which the signals corresponding to the carries C 0  and C 1  to the most significant bit generated in the carry generation and propagation circuit 101 of FIG. 2. The value indicated by the overflow signal C 0   M  is &#34; 1&#34; when the result of the subtraction (X-Y) is equal to or less than -1. Further, the value indicated by the signal C 1   M , which represents an overflow occurs when the subtraction {X-(Y-1)} is performed, is &#34;1&#34; if the result of the subtraction (X-Y) is equal to or less than 0. Thus, when the overflow signal C 0   M  outputted from the carry generation and propagation producing circuit 1001 indicates &#34;1&#34;, this signal C 0   M  indicates that the data X is less than the data Y and further this signal is outputted to the terminal L. Moreover, when the floating point overflow signal C 1m  outputted from the carry generation and propagation producing circuit 1001 indicates &#34;0&#34;, this signal C 1   M  indicates that the data X is greater than the data Y and further this signal is logically inverted and outputted to the terminal G. Furthermore, in other cases, the overflow signals indicate that the data X is equal to the data Y. When the value indicated by the overflow signal C 0   M  is &#34;0&#34; and that indicated by the overflow signal C 1   M  is &#34;1&#34;, a signal indicating &#34;1&#34; is outputted to the terminal E. 
     Thus, the carry generation and propagation producing circuit can be used in common to the generation of the floating point overflow signals C 0   M  and C 1   M . Thereby, the present invention can save a number of circuit elements included in the conventional arithmetic processor. 
     While the preferred embodiments of the present invention have been described, it is to be understood modifications will be apparent to those skilled in the art without departing from the spirit of the invention. The scope of the present invention, therefore, is to be determined solely by the appended claims.