摘要:
The invention provides circuitry for carrying out at least one of a square root operation and a division operation. The circuitry comprises a carry save adder, and a carry propagate adder part. The carry save adder and the carry propagate adder part are arranged in parallel.
摘要:
The invention provides circuitry for carrying out an arithmetic operation requiring a plurality of iterations. The circuitry comprises N sets of iteration circuitry arranged one after the other so that at least one of the sets of iteration circuitry receives an output from a preceding one of the sets of iteration circuitry. Each of the sets of iteration circuitry comprises at least one adder part, wherein a full adder is provided by at least one part in one of the sets of iteration circuitry and a second part in a succeeding one of the sets of iteration circuitry.
摘要:
An approximate solution Ya of a function F with respect to a given value X is derived by referring to a relation Y=F(X) at an accuracy at which an error between the approximate solution Ya and an infinitely precise solution Y is smaller than a weight of a digit in a place lower than a lowest place of significant digits for a final solution by two places. The approximate solution Ya is rounded to an interim solution Yr equal to one of possible interim solutions which is closest to the approximate solution Ya. A value Xr is derived from the interim solution Yr and an inverse function F -1 by referring to a relation Xr=F -1 (Yr) . A sticky digit S is set to 0, 1, or -1 in response to the relation between the magnitudes of the values X and Xr and other information. The sticky digit S is added to a place immediately lower than a lowest place of the interim solution Yr. A result of this addition is rounded in a designated rounding mode to obtain the final solution. An apparatus may be used for multiplying two numbers and subtracting a third number from the resulting product.
摘要:
An approximate solution Ya of a function F with respect to a given value X is derived by referring to a relation Y=F(X) at an accuracy at which an error between the approximate solution Ya and an infinitely precise solution Y is smaller than a weight of a digit in a place lower than a lowest place of significant digits for a final solution by two places. The approximate solution Ya is rounded to an interim solution Yr equal to one of possible interim solutions which is closest to the approximate solution Ya. A value Xr is derived from the interim solution Yr and an inverse function F⁻¹ by referring to a relation Xr=F⁻¹(Yr). A sticky digit S is set to 0, 1, or -1 in response to the relation between the magnitudes of the values X and Xr and other information. The sticky digit S is added to a place immediately lower than a lowest place of the interim solution Yr. A result of this addition is rounded in a designated rounding mode to obtain the final solution.
摘要:
Un processeur ultra-rapide utilise une logique combinatoire et une limitation de plage pour une valeur d'entrée modifiée, en vue d'augmenter l'efficacité de la détermination du facteur de convergence pour la division convergente et la calcul de la racine carrée. Une valeur d'entrée (101) est modifiée pour obtenir une certaine valeur dans une plage limitée (104), qui est ensuite divisée en deux subdivisions (106, 108). A l'aide de ces deux groupements, le programme de traitement réduit au minimum le temps nécessaire pour déterminer le facteur de conversion en inversant les bits binaires sélectionnés pour former un facteur modifié (114), et le programme utilise ensuite ce facteur modifié pour faciliter le calcul ultra-rapide du facteur de convergence.
摘要:
A processor (10) operable to calculate division and square root functions comprises a multiplier (48) having a multiplier array (116), a pipeline register (50), a correction generator (122), and a converter/rounder (52). The products generated by the multiplier array (116) are fed back to the multiplier (48) to avoid delays associated with the remainder of the multiplier circuitry. The correction generator (122) which performs a subtraction of the product output from the multiplier array (116) from a constant, is disposed between the multiplier array (116) and the converter/rounder (52). Hence, the subtraction necessary to compute the next estimate may be performed in parallel with other multiplications, further reducing the time necessary to perform the calculation. Compare circuitry (120) is operable to compare the final approximation with an operand to quickly determine the direction of rounding.
摘要:
In a floating point arithmetic unit an iterative binary arithmetic operation is performed upon two operands (D₁, D₂) applied to the unit in floating point form. The unit includes respective operating portions for deriving mantissa, exponent and sign components of the desired result (D₃) respectively, the mantissa operating portion including fixed point multiplication means (10) for multiplying together the respective mantissa components of the two operands concerned, and subtraction means (41, 42, 15) operative, in each cycle of the iterative operation, to form the inverse of the fractional part of a binary number derived from the output of the said multiplication means (10) and to increment that inverse by adding one to the least significant bit thereof. The use of such a floating point arithmetic unit can enable division and square root operations, for example, to be performed at high speed and with desirably high accuracy.