Patent US1027903A successfully refreshed from Google Patents.
Patent US4639887A successfully refreshed from Google Patents.
US4639887A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Bifurcated method and apparatus for floating point addition with decreased latency time
Assignee: United States Department of Energy
•
Filing: 1984-02-24
•
Granted: 1987-01-27
•
Expires: 2004-02-24
Abstract
Abstract Apparatus for decreasing the latency time associated with floating point addition and subtraction in a computer, using a novel bifurcated, pre-normalization/post-normalization approach that distinguishes between differences of floating point exponents.
Inventors
- 👤 Paul M. Farmwald
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 08:52
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/483; G06F7/485; G06F7/499; G06F7/49936
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
166 words
In a method for performing floating point addition of a pair of floating point binary numbers each expressed as a mantissa and an exponent, comprising the steps of alignment of the mantissas, addition of the aligned mantissas and postnormalization of the mantissa of the sum, the improvement comprising; comparing the exponents of the two floating point numbers prior to the alignment step; simultaneously performing two separate calculations along first and second separate parallel paths as follows: calculating a first sum in the first path as if the difference of the exponents is either 0 or 1, including performing the alignment step by at most a one place right shift of one mantissa; simultaneously calculating a second sum in the second path as if the difference of the exponents is greater than 1, including performing the postnormalization step by at most a one place shift of the mantissa of the second sum; selecting between the first sum and the second sum after simultaneously performing the two calculations.
Claim 2
Dependent Claim
166 words
In a method for performing floating point addition of a pair of floating point binary numbers each expressed as a mantissa and an exponent, comprising the steps of alignment of the mantissas, addition of the aligned mantissas and postnormalization of the mantissa of the sum, the improvement comprising; comparing the exponents of the two floating point numbers prior to the alignment step; simultaneously performing two separate calculations along first and second separate parallel paths as follows: calculating a first sum in the first path as if the difference of the exponents is either 0 or 1, including performing the alignment step by at most a one place right shift of one mantissa; simultaneously calculating a second sum in the second path as if the difference of the exponents is greater than 1, including performing the postnormalization step by at most a one place shift of the mantissa of the second sum; selecting between the first sum and the second sum after simultaneously performing the two calculations.
Claim 3
Dependent Claim
44 words
The method of claim 1 further comprising selecting the correct answer by testing bits of the mantissa f tmp of the second sum to determine if any of the two bits before the binary point and the bit after the binary point are nonzero.
Claim 4
Dependent Claim
24 words
The method of claim 2 further comprising selecting the second sum if 1/2≦|f tmp <5/2 and selecting the first sum if |f tmp <1/2.
Claim 5
Dependent Claim
121 words
The method of claim 3 further comprising simultaneously performing floating point subtraction of the pair of floating point binary numbers by the steps of alignment of the mantissas, subtraction and postnormalization, including calculating a first difference of the two numbers as if the difference of the exponents of the two numbers is either 0 or 1 including performing the postnormalization step by at most a one place shift of the mantissa of the first difference; simultaneously calculating a second difference of the two numbers as if the difference of the exponents is greater than 1 including performing the alignment step by at most a one place right shift of one of the mantissas; and selecting from the first and second difference.
Claim 6
Dependent Claim
186 words
Apparatus for performing floating point addition of two binary numbers, each having a mantissa and exponent, comprising (a) comparator means for determining the difference of the exponents; (b) a first adder circuit comprising: (1) first shift means for performing at most a one place right shift of one mantissa; (2) first adder means connected to the first shift means for adding the mantissas to form a first sum; (3) second shift means connected to the first adder means for realigning the mantissa of the first sum; (c) a second adder circuit comprising: (1) third shift means for aligning the mantissas of the two binary numbers; (2) second adder means connected to the third shift means for adding the aligned mantissas to form a second sum; (3) fourth shift means connected to the second adder means for performing at most a one place shift to realign the mantissa of the second sum; (d) selection means for selectively choosing the output from the first adder circuit when the exponent difference is 0 or 1 and from the second adder circuit when the exponent difference is greater than 1.
Claim 7
Dependent Claim
186 words
Apparatus for performing floating point addition of two binary numbers, each having a mantissa and exponent, comprising (a) comparator means for determining the difference of the exponents; (b) a first adder circuit comprising: (1) first shift means for performing at most a one place right shift of one mantissa; (2) first adder means connected to the first shift means for adding the mantissas to form a first sum; (3) second shift means connected to the first adder means for realigning the mantissa of the first sum; (c) a second adder circuit comprising: (1) third shift means for aligning the mantissas of the two binary numbers; (2) second adder means connected to the third shift means for adding the aligned mantissas to form a second sum; (3) fourth shift means connected to the second adder means for performing at most a one place shift to realign the mantissa of the second sum; (d) selection means for selectively choosing the output from the first adder circuit when the exponent difference is 0 or 1 and from the second adder circuit when the exponent difference is greater than 1.
Claim 8
Dependent Claim
61 words
The apparatus of claim 5 wherein the first adder circuit further includes priority encoder means connected to the output of the first adder means to determine the number of places to shift the sum of the aligned mantissas, the output of the priority encoder being connected to the second shift means to control the realignment of the mantissa of the sum.
Claim 9
Dependent Claim
45 words
The apparatus of claim 6 wherein the first adder circuit further includes a third adder means connected to the exponent comparator and to the priority encoder to add the output of the priority encoder to the greater of the two exponents of the two numbers.
Claim 10
Dependent Claim
31 words
The apparatus of claim 5 wherein the first shift means comprises a pair of two input multiplexers, each having as inputs an unshifted mantissa and a one place right shifted mantissa.
Claim 11
Dependent Claim
36 words
The apparatus of claim 8 further including a short alignment shift calculator for comparing the two lowest order bits of the two exponents and connected to the multiplexers to select the unshifted or right shifted mantissa.
Claim 12
Dependent Claim
32 words
The apparatus of claim 5 wherein the selection means comprises a magnitude comparator for comparing the magnitude of the output from the second adder means with the values 1/2, 1 and 2.
Claim 13
Dependent Claim
59 words
The apparatus of claim 10 wherein the fourth shift means comprises three inputs of a four-input multiplexer having as inputs the unshifted output of the second adder, the right shifted output of the second adder, and the left shifted output of the second adder, and further having the output of the second shift means connected to the fourth input.
Claim 14
Dependent Claim
33 words
The apparatus of claim 10 further including an exponent increment means and an exponent multiplexer means connected to the exponent increment means and the magnitude comparator for selecting the exponent of the same.
Claim 15
Dependent Claim
16 words
The apparatus of claim 5 wherein the third shift means comprises a pair of barrel shifters.
Claim 16
Dependent Claim
82 words
The apparatus of claim 5 further including first subtracter means in parallel with the second adder means and wherein the first shift means includes a four-input multiplexer having as inputs an unshifted mantissa, a right shifted mantissa, a negative mantissa, and a negative right shifted mantissa, and an exclusive OR gate to compare the signs of the two mantissas, the exclusive OR gate being connected to the multiplexer to select the positive or negative value of the unshifted or right shifted mantissa.
References Cited (Backward Citations)
US3814925A
Cited
US4488252A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-01-26 | 1990-07-28 | 1991-01-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-01-26 | 1994-07-28 | 1995-01-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-01-26 | 1998-07-28 | 1999-01-27 | $7700.00 | Window Closed / Lapsed |