摘要:
A method and apparatus is disclosed that utilizes ''Lindsley's Law'', a polynomial convergence algorithm, suitable even for high convergence rates, to implement more efficient reciprocal j root, and hence, j root itself, computations of desired inputs. The invention emphasizes multiplication (114, 116, 118, 120), instead of addition, as the iterative operator, thereby reducing error at a rate relative to a power of a selected convergence rate.
摘要:
L'invention a pour objet un procédé et un système utilisant la ''Loi de Lindsley'', algorithme de convergence polynôme, adaptable même aux taux de convergence élevés, pour mettre en application une racine jème inverse plus efficace et, de ce fait, la racine jème elle-même, pour calculer des quantités désirées. L'invention met l'accent sur la multiplication (114, 116, 118, 120) au lieu de l'addition, en tant qu'opérateur itératif, de ce fait réduisant l'erreur à un taux relatif à une puissance d'un taux de convergence sélectionné.
摘要:
Methods and systems for determining whether an infinitely precise result of a reciprocal square root operation performed on an input floating point number is greater than a particular number in a first floating point precision. The method includes calculating the square of the particular number in a second lower floating point precision; calculating an error in the calculated square due to the second floating point precision; calculating a first delta value in the first floating point precision by calculating the square multiplied by the input floating point number less one; calculating a second delta value by calculating the error multiplied by the input floating point number plus the first delta value; and outputting an indication of whether the infinitely precise result of the reciprocal square root operation is greater than the particular number based on the second delta term. To be accompanied, when published, by FIG. 3 of the accompanying drawings.
摘要:
Methods and systems for determining whether an infinitely precise result of a reciprocal square root operation performed on an input floating point number is greater than a particular number in a first floating point precision. The method includes calculating the square of the particular number in a second lower floating point precision; calculating an error in the calculated square due to the second floating point precision; calculating a first delta value in the first floating point precision by calculating the square multiplied by the input floating point number less one; calculating a second delta value by calculating the error multiplied by the input floating point number plus the first delta value; and outputting an indication of whether the infinitely precise result of the reciprocal square root operation is greater than the particular number based on the second delta term. To be accompanied, when published, by FIG. 3 of the accompanying drawings.
摘要:
A method and apparatus is disclosed that utilizes ''Lindsley's Law'', a polynomial convergence algorithm, suitable even for high convergence rates, to implement more efficient reciprocal jth root, and hence, jth root itself, computations of desired inputs. The invention emphasizes multiplication (114, 116, 118, 120), instead of addition, as the iterative operator, thereby reducing error at a rate relative to a power of a selected convergence rate.
摘要:
The method and circuit find the reciprocal value of an input vector signal. The level of the input vector signal (X + jY) is first reduced to (X + jY)/ 2 in an overflow-preventing circuit. A power calculating circuit squares and adds the components of the level-reduced input vector signal, thereby obtaining a power value (X² + Y²)/2 . An initial value of a tap value (K), which represents the reciprocal value to be found, is multiplied twice by a multiplying circuit, thereby obtaining K²(X + Y)²/2 . Further, a differential circuit obtains an error signal (ΔK) = 1/2 - K²(X² + Y²)/2 by subtraction from a reference value. An updating circuit updates the tap value (K) by adding to it the error signal (ΔK). A loop consisting of the multiplication of the tap value, differential operation, and updating of the tap value, is repeated until the error signal (ΔK) is reduced to less than or equal to a predetermined value. The tap value (K) thus obtained is the desired reciprocal value 1/√(X² + Y²) of the amplitude of the input vector signal. The method and circuit can be used for amplitude normalization in a modem, for example.