US5260889A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Computation of sticky-bit in parallel with partial products in a floating point multiplier unit
Assignee: Intel Corp
•
Filing: 1992-03-31
•
Granted: 1993-11-09
•
Expires: 2012-03-31
Abstract
Abstract A floating point unit multiply logic in which a sticky bit is computed in parallel with partial product generation and reduction for three different rounding precisions and two different operand, ranges. Two sticky bits need to be calculated during the parallel operation because the result can be anywhere between 0 and 4 and it will not be known which is correct until after the result of the multiplication has been calculated. If the result is between 0 and 2, then a first sticky bit is generated. When the result is between 2 and 4, a second sticky bit is generated. It is not known which sticky bit is the correct one to use until the final addition is performed. Once the results of the final addition is known, the correct sticky bit is selected using a carry out from the adder, the overflow bit. If the overflow bit is a 1, then the first sticky bit is selected. If the overflow bit is a 0, then the second sticky bit is selected.
Inventors
- 👤 Krishnan J. Palaniswami
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 17:27
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/483; G06F7/487; G06F7/4876; G06F7/499; G06F7/49942; G06F7/49947; G06F7/49952
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
259 words
A sticky bit generator in a floating point multiplier operating within a chosen precision to multiply floating point numbers comprised of an overflow bit, a mantissa field and an exponent field wherein the relative positions of the least significant bit of the mantissa before rounding are a round bit (R), and sticky bits (S); comprising: first means for adding a multiplicand trailing-zero count and a multiplier trailing-zero count to produce a trailing-zero count-sum; second means connected to said first means for selecting a correct constant to compare with said trailing-zero count-sum depending on a precision chosen to determine a sticky bit; a first comparator means connected to said second means for comparing against a first constant based on said precision control for generating a first sticky bit having a value of zero upon the condition that an output of said comparator is one and having a value of one upon the condition that said output of said comparator is zero; second comparator means connected to said second means for comparing against a second constant based on said precision control for generating a second sticky bit having a value of zero upon the condition that said output of said comparator is one and having a value of one upon the condition that said output of said comparator is zero; said first and second constants being determined from the number of bits to the right of said round bit; and, third means responsive to said overflow bit for selecting said first sticky bit and alternatively for selecting said second sticky bit.
Claim 2
Dependent Claim
259 words
A sticky bit generator in a floating point multiplier operating within a chosen precision to multiply floating point numbers comprised of an overflow bit, a mantissa field and an exponent field wherein the relative positions of the least significant bit of the mantissa before rounding are a round bit (R), and sticky bits (S); comprising: first means for adding a multiplicand trailing-zero count and a multiplier trailing-zero count to produce a trailing-zero count-sum; second means connected to said first means for selecting a correct constant to compare with said trailing-zero count-sum depending on a precision chosen to determine a sticky bit; a first comparator means connected to said second means for comparing against a first constant based on said precision control for generating a first sticky bit having a value of zero upon the condition that an output of said comparator is one and having a value of one upon the condition that said output of said comparator is zero; second comparator means connected to said second means for comparing against a second constant based on said precision control for generating a second sticky bit having a value of zero upon the condition that said output of said comparator is one and having a value of one upon the condition that said output of said comparator is zero; said first and second constants being determined from the number of bits to the right of said round bit; and, third means responsive to said overflow bit for selecting said first sticky bit and alternatively for selecting said second sticky bit.
Claim 3
Independent Claim
241 words
A method of generating a sticky bit in a floating point multiplier operating within a chosen precision to multiply a multiplicand by a multiplier, said multiplicand and said multiplier each being a floating point numbers comprised of a mantissa field and an exponent field wherein the relative positions of the least significant bit of the mantissa before rounding are a round bit (R), and sticky bits (S), comprising the steps of: A. summing a trailing-zero count of said multiplicand and a trailing-zero count of said multiplier to provide a first sum; B. selecting a first constant depending on a first precision chosen to determine a first sticky bit or a second constant depending on a second precision chosen to determine a second sticky bit; C. comparing said first sum in a first comparator against said first constant; D. generating, if an output of said first comparator is one, a first sticky bit of one, or a first sticky bit of zero; E. comparing said second sum in a second comparator against a second constant; F. generating, if said output of said second comparator is one, a second sticky bit of one, or a second sticky bit of zero; G. selecting, if an unrounded product of said multiplicand and said multiplier is between 0 and 2, said first sticky bit, and, H. selecting, if an unrounded product of an multiplicand and said multiplier is between 2 and 4, said second sticky bit.
Claim 4
Independent Claim
241 words
A method of generating a sticky bit in a floating point multiplier operating within a chosen precision to multiply a multiplicand by a multiplier, said multiplicand and said multiplier each being a floating point numbers comprised of a mantissa field and an exponent field wherein the relative positions of the least significant bit of the mantissa before rounding are a round bit (R), and sticky bits (S), comprising the steps of: A. summing a trailing-zero count of said multiplicand and a trailing-zero count of said multiplier to provide a first sum; B. selecting a first constant depending on a first precision chosen to determine a first sticky bit or a second constant depending on a second precision chosen to determine a second sticky bit; C. comparing said first sum in a first comparator against said first constant; D. generating, if an output of said first comparator is one, a first sticky bit of one, or a first sticky bit of zero; E. comparing said second sum in a second comparator against a second constant; F. generating, if said output of said second comparator is one, a second sticky bit of one, or a second sticky bit of zero; G. selecting, if an unrounded product of said multiplicand and said multiplier is between 0 and 2, said first sticky bit, and, H. selecting, if an unrounded product of an multiplicand and said multiplier is between 2 and 4, said second sticky bit.
Claim 5
Dependent Claim
257 words
A sticky bit generator is a floating point multiplier operating within a chosen precision to multiply floating point numbers comprised of an overflow bit, a mantissa field and an exponent field wherein the relative positions of the least significant bits of the mantissa before rounding are a round bit (R), and sticky bits (S); comprising: an adder for adding a multiplicand trailing-zero count and a multiplier trailing-zero count to produce a trailing-zero count-sum; a first mux connected to said adder for selecting a correct constant to compare with said trailing-zero count-sum depending on a precision chosen to determine a sticky bit; a first comparator connected to said mux for comparing against a first constant based on said precision control for generating a first sticky bit having a value of zero upon the condition that an output of said comparator is one and having a value of one upon the condition that said output of said comparator is zero; a second comparator connected to said mux for comparing against a second constant based on said precision control for generating a second sticky bit having a value of zero upon the condition that said output of said comparator is one and having a value of one upon the condition that said output of said comparator is zero; said first and second constants being determined from the number of bits to the right of said round bit; and, a second mux responsive to said overflow bit for selecting said first sticky bit and alternatively for selecting said second sticky bit.
Claim 6
Dependent Claim
257 words
A sticky bit generator is a floating point multiplier operating within a chosen precision to multiply floating point numbers comprised of an overflow bit, a mantissa field and an exponent field wherein the relative positions of the least significant bits of the mantissa before rounding are a round bit (R), and sticky bits (S); comprising: an adder for adding a multiplicand trailing-zero count and a multiplier trailing-zero count to produce a trailing-zero count-sum; a first mux connected to said adder for selecting a correct constant to compare with said trailing-zero count-sum depending on a precision chosen to determine a sticky bit; a first comparator connected to said mux for comparing against a first constant based on said precision control for generating a first sticky bit having a value of zero upon the condition that an output of said comparator is one and having a value of one upon the condition that said output of said comparator is zero; a second comparator connected to said mux for comparing against a second constant based on said precision control for generating a second sticky bit having a value of zero upon the condition that said output of said comparator is one and having a value of one upon the condition that said output of said comparator is zero; said first and second constants being determined from the number of bits to the right of said round bit; and, a second mux responsive to said overflow bit for selecting said first sticky bit and alternatively for selecting said second sticky bit.
References Cited (Backward Citations)
US4928259A
Cited
US5128889A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-11-08 | 1997-05-10 | 1997-11-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-11-08 | 2001-05-10 | 2001-11-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-11-08 | 2005-05-10 | 2005-11-09 | $7700.00 | Window Closed / Lapsed |