US5386523A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Addressing scheme for accessing a portion of a large memory space
Assignee: Enterasys Networks Inc
•
Filing: 1992-01-10
•
Granted: 1995-01-31
•
Expires: 2012-01-10
Abstract
Abstract A method for generating an address for addressable locations of a computer system where two registers are overlapped. Those bits of the two registers that overlap are logically combined together using a boolean operation when generating the address. Using this method, the higher order register can be used to select a segment of the addressable space of the computer system. Then, all accesses to that portion of the addressable space can be controlled by changing only the lower order register. This results in a saving of time since only one of the registers need be reloaded for each subsequent access.
Inventors
- 👤 Neal A. Crook
- 👤 Michael J. Seaman
- 👤 David L. A. Brash
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 05:37
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/0215; G06F9/00; G06F9/06; G06F9/30; G06F9/30003; G06F9/30007; G06F9/30018; G06F9/30098; G06F9/30105; G06F9/30112; G06F9/34; G06F9/342
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
203 words
A method of generating an address in a computer system, the address being represented by a first number of address bits, each unique value of the address corresponding to a unique memory location in the computer system, comprising the steps of: a) loading a first register with binary data, the first register including a first number of register storage locations, the first number of register storage locations being less than the first number of address bits; b) loading a second register with binary data, the second register including a second number of register storage locations, the second number of register storage locations being less than the first number of address bits; c) logically combining in a boolean operation a bit in each of a preselected third number of register storage locations of the first register only with a bit in each of a preselected equal number of corresponding register storage locations of the second register to generate an equal number of logical combination result bits; d) concatenating the logical combination result bits of step c, and binary data in the first and second registers not logically combined in step c to thereby generate the address represented by the first number of address bits.
Claim 2
Independent Claim
203 words
A method of generating an address in a computer system, the address being represented by a first number of address bits, each unique value of the address corresponding to a unique memory location in the computer system, comprising the steps of: a) loading a first register with binary data, the first register including a first number of register storage locations, the first number of register storage locations being less than the first number of address bits; b) loading a second register with binary data, the second register including a second number of register storage locations, the second number of register storage locations being less than the first number of address bits; c) logically combining in a boolean operation a bit in each of a preselected third number of register storage locations of the first register only with a bit in each of a preselected equal number of corresponding register storage locations of the second register to generate an equal number of logical combination result bits; d) concatenating the logical combination result bits of step c, and binary data in the first and second registers not logically combined in step c to thereby generate the address represented by the first number of address bits.
Claim 3
Dependent Claim
46 words
The method of claim 1, further comprising: e) loading new binary data in the second register only; and f) changing the address represented by the first number of address bits by repeating steps c and d using the new binary data loaded in the second register.
Claim 4
Dependent Claim
35 words
The method of claim 1, wherein the first register includes binary locations for a high order portion of the address and the second register includes binary locations for a low order portion of the address.
Claim 5
Dependent Claim
22 words
The method of claim 3, wherein preselected ones of the third number of register storage locations are loaded with binary zero values.
Claim 6
Dependent Claim
67 words
The method of claim 4, wherein preselected ones of the third number of register storage locations in the second register are loaded with binary zero values, said preselected register storage locations corresponding to ones of the third number of register storage locations in the first register other than the preselected ones of the register storage locations in the first register which are loaded with binary zero values.
Claim 7
Dependent Claim
35 words
The method of claim 5, wherein the binary data of the first register not logically combined in step c correspond to highest order address bits of a segment of memory locations in the computer system.
Claim 8
Dependent Claim
21 words
The method of claim 6, wherein in step c, the logically combined binary data is combined using a logical OR function.
Claim 9
Dependent Claim
22 words
The method of claim 3, wherein preselected ones of the third number of register storage locations are loaded with binary 1 values.
Claim 10
Dependent Claim
35 words
The method of claim 8, wherein the binary data of the first register not logically combined in step c corresponds to highest order address bits of a segment of memory locations in the computer system.
Claim 11
Dependent Claim
110 words
The method of claim 3, wherein before step d the method further comprises: e) loading a third register with binary data as a portion of the address represented by the first number of address bits, the third register including a fourth number of register storage locations, the fourth number of register storage locations being less than the first number of address bits; and f) wherein step d includes concatenating the logically combined data of step c, binary data in the third register and binary data in the first and second registers not logically combined in step c to thereby generate the address represented by the first number of address bits.
Claim 12
Dependent Claim
21 words
The method of claim 10, wherein in step c, the logically combined binary data is combined using a logical OR function.
Claim 13
Independent Claim
168 words
An apparatus for generating an address to locate a location in a memory, comprising: a first register having a first number of register storage locations for storage of a first number of address bits; a second register having a second number of register storage locations for storage of a second number of address bits; and a logic device coupled to each of the first and second registers for logically combining in a boolean operation a bit in each of a preselected third number of register storage locations of the first register only with a bit in each of a preselected equal number of corresponding register storage locations of the second register to provide an equal number of logically combined address bits; whereby the address to locate a location in a memory, comprises the logically combined address bits and address bits of the first and second address bits other than the bits of the preselected third number of register storage locations in each of the first and second registers.
Claim 14
Independent Claim
168 words
An apparatus for generating an address to locate a location in a memory, comprising: a first register having a first number of register storage locations for storage of a first number of address bits; a second register having a second number of register storage locations for storage of a second number of address bits; and a logic device coupled to each of the first and second registers for logically combining in a boolean operation a bit in each of a preselected third number of register storage locations of the first register only with a bit in each of a preselected equal number of corresponding register storage locations of the second register to provide an equal number of logically combined address bits; whereby the address to locate a location in a memory, comprises the logically combined address bits and address bits of the first and second address bits other than the bits of the preselected third number of register storage locations in each of the first and second registers.
Claim 15
Dependent Claim
15 words
The apparatus of claim 12, wherein the logic device comprises a set of OR gates.
Claim 16
Independent Claim
221 words
A method of generating an address in a computer system, the address being represented by a first number of address bits, each unique value of the address corresponding to a unique memory location in the computer system, comprising the steps of: a) loading a first register with binary data, the first register including a first number of register storage locations, the first number of register storage locations being less than the first number of address bits; b) loading a second register with binary data, the second register including a second number of register storage locations, the second number of register storage locations being less than the first number of address bits; c) logically combining binary data in a preselected third number of register storage locations of the first register and binary data in an equal number of corresponding register storage locations of the second register, wherein individual binary data from each of the register storage locations of the first register is logically combined in a single boolean operation with individual binary data from each of the corresponding register storage locations of the second register; d) concatenating the logically combined data of step c, and binary data in the first and second registers not logically combined in step c to thereby generate the address represented by the first number of address bits.
Claim 17
Independent Claim
221 words
A method of generating an address in a computer system, the address being represented by a first number of address bits, each unique value of the address corresponding to a unique memory location in the computer system, comprising the steps of: a) loading a first register with binary data, the first register including a first number of register storage locations, the first number of register storage locations being less than the first number of address bits; b) loading a second register with binary data, the second register including a second number of register storage locations, the second number of register storage locations being less than the first number of address bits; c) logically combining binary data in a preselected third number of register storage locations of the first register and binary data in an equal number of corresponding register storage locations of the second register, wherein individual binary data from each of the register storage locations of the first register is logically combined in a single boolean operation with individual binary data from each of the corresponding register storage locations of the second register; d) concatenating the logically combined data of step c, and binary data in the first and second registers not logically combined in step c to thereby generate the address represented by the first number of address bits.
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) | 1998-01-30 | 1998-08-01 | 1999-01-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-01-30 | 2002-08-01 | 2003-01-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-01-30 | 2006-08-01 | 2007-01-31 | $7700.00 | Window Closed / Lapsed |