Addressing scheme for accessing a portion of a large memory space
First Claim
1. 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.
7 Assignments
0 Petitions
Accused Products
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.
41 Citations
14 Claims
-
1. 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. 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. - View Dependent Claims (13)
-
-
14. 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.
-
Specification