US4305134A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Automatic operand length control of the result of a scientific arithmetic operation
Assignee: Bull HN Information Systems Inc
•
Filing: 1979-11-08
•
Granted: 1981-12-08
•
Expires: 1999-11-08
Abstract
Abstract Mantissa results of floating point operations are truncated to words of 24 bits each by storing the 64 bit mantissa result in a first address location of a random access memory, and storing binary ZEROs in the 48 least significant bit positions of a second address location of the random access memory. The mantissa result is truncated by addressing the high order 24 bits at the first address location and the 48 binary ZEROs at the second address location.
Inventors
- 👤 Thomas F. Joyce
- 👤 Richard A. Lemay
- 👤 William E. Woods
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 08:03
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/483; G06F7/499; G06F7/49942; G06F7/49947
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
185 words
A processing system comprising: a random access memory having a first and second plurality of address locations, each having an upper portion and a lower portion for storing operand mantissas in said first plurality of address locations and for storing binary ZERO bits in said lower portion of said second plurality of address locations; register means for generating a plurality of length signals indicative of the length of each of said operand mantissas; and addressing means coupled to said register means and said random access memory being responsive to one of said plurality of length signals in a first state for selecting one of said operand mantissas from said upper and said lower portions of one of said first plurality of address locations, and being responsive to said one of said plurality of length signals in a second state for selecting said one of said operand mantissas from said upper portion of said one of said first plurality of address locations and said lower portion of a corresponding one of said second plurality of address locations for transfer of said operand mantissas to an output.
Claim 2
Dependent Claim
185 words
A processing system comprising: a random access memory having a first and second plurality of address locations, each having an upper portion and a lower portion for storing operand mantissas in said first plurality of address locations and for storing binary ZERO bits in said lower portion of said second plurality of address locations; register means for generating a plurality of length signals indicative of the length of each of said operand mantissas; and addressing means coupled to said register means and said random access memory being responsive to one of said plurality of length signals in a first state for selecting one of said operand mantissas from said upper and said lower portions of one of said first plurality of address locations, and being responsive to said one of said plurality of length signals in a second state for selecting said one of said operand mantissas from said upper portion of said one of said first plurality of address locations and said lower portion of a corresponding one of said second plurality of address locations for transfer of said operand mantissas to an output.
Claim 3
Dependent Claim
31 words
The processing system of claim 1 wherein said random access memory has said corresponding one of said second plurality of address locations for each of said first plurality of address locations.
Claim 4
Dependent Claim
127 words
The processing system of claim 2 wherein said addressing means comprises: multiplexer means coupled to said register means and responsive to a plurality of task signals for selecting said one of said plurality of length signals in said first state for generating a long signal in a first state for selecting said upper and said lower portions of said one of said first plurality of address locations defined by said plurality of task signals, and selecting said one of said plurality of length signals in said second state for generating said long signal in said second state for selecting said upper portion of said one of said first plurality of address locations and said lower portion of said corresponding one of said second plurality of address locations.
Claim 5
Dependent Claim
202 words
The processing system of claim 3 wherein said multiplexer means comprises: a first multiplexer coupled to said register means and responsive to a first and a second of said plurality of task signals for selecting said one of said plurality of length signals of a first accumulator for generating a first length signal; a second multiplexer coupled to said register means and responsive to a third and a fourth of said plurality of task signals for selecting said one of said plurality of length signals of a second accumulator for generating a second length signal; a third multiplexer coupled to said register means and responsive to said first and said second task signals for selecting said one of said plurality of length signals of a memory length associated with said first accumulator for generating a third signal; and a fourth multiplexer coupled to said first, said second, and said third multiplexers and responsive to a first and a second control signal for selecting said first, said second or said third length signal or a third control signal for generating said long signal for indicating the length of said first or said second accumulator or said memory length associated with said first accumulator.
Claim 6
Dependent Claim
32 words
The processing system of claim 4 wherein said plurality of length signals in said first state indicates a four word operand mantissa and in said second state indicates a two word mantissa.
Claim 7
Dependent Claim
22 words
The processing system of claim 5 wherein said first accumulator is identified as SA# and said second accumulator is identified as SAN.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1984-12-07 | 1985-06-08 | 1985-12-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1988-12-07 | 1989-06-08 | 1989-12-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1992-12-07 | 1993-06-08 | 1993-12-08 | $7700.00 | Window Closed / Lapsed |