← Back to Patent Explorer
US4941120A Expired / Lapsed US ⏱️ 0.0 years remaining

Floating point normalization and rounding prediction circuit

Assignee: International Business Machines Corp
•
Filing: 1989-04-17
•
Granted: 1990-07-10
•
Expires: 2009-04-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Apparatus for enhancing certain floating point arithmetic operations, by examining the initial operands and the exponent and fractional results and predicting when the steps of postnormalization and rounding can be skipped. The fraction result format enables a prediction of normalization and rounding under each of the addition, subtraction and multiplication possibilities, and under each of the various choices of rounding mode which are used in floating point arithmetic.

Inventors

  • 👤 Jeffrey D. Brown
  • 👤 Donald L. Freerksen
  • 👤 Scott A. Hilker
  • 👤 Daniel L. Stasiak

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 20:30
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/483; G06F7/499; G06F7/49936; G06F7/49942; G06F7/49947

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 233 words
A circuit for normalizing floating point arithmetic results of certain predetermined types, and for predicting whether rounding is necessary by examination of predetermined bits in the arithmetic result, comprising (a) means for detecting arithmetic operations of the multiply type, and addition of operands of same sign, and subtraction of operands of different signs, and activating a transfer sequence in response thereto; (b) said transfer sequence including means for examining the two most significant bits of the result fraction and completing a transfer of the fraction and exponent result into a register according to the following procedure: (i) if a multiply type and the two most significant fraction bits are of the form 1.X, transfer the results directly into said register, and increase the exponent by one; (ii) if a multiply type and the two most significant fraction bits are of the form 0.1, transfer the fractional result into said register with a 1-bit left shift, and transfer the exponent directly, unchanged, into said register; (iii) if an addition or subtraction type and the two most significant fraction bits are of the form 1.X, transfer the results directly into said register; and (iv) if an addition or subtraction type and the two most significant fraction bits are of the form 1X., transfer the fractional results directly into said register; with a 1-bit right shift, and transfer the exponent, increased by one, into said register.
Claim 2
Dependent Claim 233 words
A circuit for normalizing floating point arithmetic results of certain predetermined types, and for predicting whether rounding is necessary by examination of predetermined bits in the arithmetic result, comprising (a) means for detecting arithmetic operations of the multiply type, and addition of operands of same sign, and subtraction of operands of different signs, and activating a transfer sequence in response thereto; (b) said transfer sequence including means for examining the two most significant bits of the result fraction and completing a transfer of the fraction and exponent result into a register according to the following procedure: (i) if a multiply type and the two most significant fraction bits are of the form 1.X, transfer the results directly into said register, and increase the exponent by one; (ii) if a multiply type and the two most significant fraction bits are of the form 0.1, transfer the fractional result into said register with a 1-bit left shift, and transfer the exponent directly, unchanged, into said register; (iii) if an addition or subtraction type and the two most significant fraction bits are of the form 1.X, transfer the results directly into said register; and (iv) if an addition or subtraction type and the two most significant fraction bits are of the form 1X., transfer the fractional results directly into said register; with a 1-bit right shift, and transfer the exponent, increased by one, into said register.
Claim 3
Dependent Claim 78 words
The circuit of claim 1, further comprising means for examining the result sign bit, least significant bit, guard bit, round bit and sticky bit; and means for detecting the rounding mode selected for the arithmetic operation; and means for predicting whether a rounding of the fractional result is necessary as a consequence of said examination of result sign bit, least significant bit, guard bit, round bit and sticky bit, and said means for detecting the rounding mode selected.
Claim 4
Dependent Claim 19 words
The circuit of claim 2, further comprising means for skipping the rounding as result of said means for predicting.
Claim 5
Dependent Claim 383 words
The circuit of claim 3, wherein said means for predicting further comprises a plurality of logic circuits coupled to said means for examining the result sign bit, least significant bit, guard bit, round bit and sticky bit, and coupled to said means for detecting the selected rounding mode, said plurality of logic circuits including a decision network for activating said means for skipping round according to the following tabulation, where "No" signifies skipping rounding: ______________________________________ S L I S G Rounding Mode B G R S N Nearest Pos Inf Neg Inf Zero ______________________________________ 0 0 0 0 0 No No No No 0 0 0 1 0 No Yes No No 0 0 1 0 0 No Yes No No 0 0 1 1 0 No Yes No No 0 1 0 0 0 No Yes No No 0 1 0 1 0 Yes Yes No No 0 1 1 0 0 Yes Yes No No 0 1 1 1 0 Yes Yes No No 1 0 0 0 0 No No No No 1 0 0 1 0 No Yes No No 1 0 1 0 0 No Yes No No 1 0 1 1 0 No Yes No No 1 1 0 0 0 Yes Yes No No 1 1 0 1 0 Yes Yes No No 1 1 1 0 0 Yes Yes No No 1 1 1 1 0 Yes Yes No No 0 0 0 0 1 No No No No 0 0 0 1 1 No No Yes No 0 0 1 0 1 No No Yes No 0 0 1 1 1 No No Yes No 0 1 0 0 1 No No Yes No 0 1 0 1 1 Yes No Yes No 0 1 1 0 1 Yes No Yes No 0 1 1 1 1 Yes No Yes No 1 0 0 0 1 No No No No 1 0 0 1 1 No No Yes No 1 0 1 0 1 No No Yes No 1 0 1 1 1 No No Yes No 1 1 0 0 1 Yes No Yes No 1 1 0 1 1 Yes No Yes No 1 1 1 0 1 Yes No Yes No 1 1 1 1 1 Yes No Yes No. ______________________________________

References Cited (Backward Citations)

US3621218A Cited
US4612628A Cited
US4754422A Cited
US4639887A Cited
US4796217A Cited
US4779220A Cited
US4758972A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-07-09 1994-01-08 1994-07-10 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-07-09 1998-01-08 1998-07-10 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-07-09 2002-01-08 2002-07-10 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag