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

Memory comprising simultaneously addressable memory elements

Assignee: Adelante Technologies BV
•
Filing: 1987-03-31
•
Granted: 1989-07-04
•
Expires: 2007-03-31
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A random access memory (1) is described in which one address of a row of addresses is activatable. There is also realized a block addressing mode in which all addresses between a selectable first address and a selectable second address are activated. To this end there are provided two address registers (4, 5) and a logic tree structure (8) which consists of modules. At each level of the tree structure a module receives a part of the information from the two address registers in order to determine, possibly co-controlled by information received from a higher level of the tree, whether one or both limit addresses are situated within the address range covered by the module and, if the answer is negative, to determine whether all addresses of this address range must be activated or remain deactivated.

Inventors

  • 👤 Cornelis H. van Berkel
  • 👤 Roelof H. W. Salters

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 08:58
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/14; G; G06; G06F; G06F12/00; G06F12/02; G06F12/0207; G11; G11C; G11C8/00; G11C8/10

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 290 words
A memory comprising: a. an array of memory elements (1), defining at least one coordinate direction, which elements are simultaneously addressable at random in subarrays defined by at least one respective range of addresses along the at least one coordinate direciton; b. at least one selection means (8,9) for addressing a subarray (2) defined by at least one respective desired range of addresses in at least one respective one of the at least one coordinate direction, each selection means comprising: i. respective input means for receiving respective upper (X H ,Y H ) and lower (X L ,Y L ) limit information defining said respective desired range; ii. a respective plurality of similary-operating selection modules (11,12), arranged as nodes connecting branches in a vertical tree structure having a plurality of levels, each module being responsive to a part of said upper and lower limit information, each module corresponding to a respective module range of addresses, with the respective module range of addresses being smaller for modules at lower levels of the tree and having: A. a respective input for receiving an indication signal (BE, LE, RE, OR, IR) which provides a position indication for indicating a position of the part of the upper and lower limit information with respect to the respective module range of addresses, and B. a respective output means for supplying further indication signals such that in the modules at a lowest level of the tree structure the further indication signals are addressing signals for the memory elements in the subarray, and in the modules not at the lowest level of the tree structure the further indication signals are more specific position information for modules therebelow; whereby, granularity of selection of the memory elements is arbitrarily low.
Claim 2
Dependent Claim 290 words
A memory comprising: a. an array of memory elements (1), defining at least one coordinate direction, which elements are simultaneously addressable at random in subarrays defined by at least one respective range of addresses along the at least one coordinate direciton; b. at least one selection means (8,9) for addressing a subarray (2) defined by at least one respective desired range of addresses in at least one respective one of the at least one coordinate direction, each selection means comprising: i. respective input means for receiving respective upper (X H ,Y H ) and lower (X L ,Y L ) limit information defining said respective desired range; ii. a respective plurality of similary-operating selection modules (11,12), arranged as nodes connecting branches in a vertical tree structure having a plurality of levels, each module being responsive to a part of said upper and lower limit information, each module corresponding to a respective module range of addresses, with the respective module range of addresses being smaller for modules at lower levels of the tree and having: A. a respective input for receiving an indication signal (BE, LE, RE, OR, IR) which provides a position indication for indicating a position of the part of the upper and lower limit information with respect to the respective module range of addresses, and B. a respective output means for supplying further indication signals such that in the modules at a lowest level of the tree structure the further indication signals are addressing signals for the memory elements in the subarray, and in the modules not at the lowest level of the tree structure the further indication signals are more specific position information for modules therebelow; whereby, granularity of selection of the memory elements is arbitrarily low.
Claim 3
Dependent Claim 96 words
The memory of claim 1 wherein a. each upper and lower limit information comprises respective first and second bit sequences; b. each of the modules comprises a respective second input means for receiving one bit from the respective first bit sequence and a corresponding bit from the respective second bit sequence; c. each of the modules not at the lowest level supplies two further indication signals to two respective selection modules at a lower level; and d. each of the modules at the lowest level supplies two addressing signals to relevant ones of the memory elements.
Claim 4
Dependent Claim 87 words
The memory of claim 2 wherein a. the array of memory elements defines and is addressable in first and second coordinate directions; and b. there are first and second selection means for addressing a subarray which is defined by first and second respective first and second desired ranges of memory elements in the first and second coordinate directions and the respective input means of each selection means is for receiving respective upper and lower limit information for a respective one of the first and second desired ranges.
Claim 5
Dependent Claim 87 words
The memory of claim 1 wherein a. the array of memory elements defines and is addressable in first and second coordinate directions; and b. there are first and second selection means for addressing a subarray which is defined by first and second respective first and second desired ranges of memory elements in the first and second coordinate directions and the respective input means of each selection means is for receiving respective upper and lower limit information for a respective one of the first and second desired ranges.
Claim 6
Dependent Claim 43 words
The memory of claim 1 wherein each memory element comprises means for simultaneously gating the addressing signals from the lowest level of the tree structure to the memory elements, so that only the memory elements covered by a relevant desired range are activated.
Claim 7
Dependent Claim 18 words
The memory of claim 1 wherein all of the selection modules not on the lowest level are identical.
Claim 8
Dependent Claim 50 words
Memory apparatus comprising: a. a plurality of the memories as claimed in claim 1, 2, 4, 3, 5, or 6, arranged on chips into rows and/or columns and addressable by a further tree structure; and b. a plurality of further selection means acting as nodes in the further tree structure.
Claim 9
Dependent Claim 349 words
Memory apparatus comprising: a plurality of chips arranged in rows and/or columns, each chip comprising a memory which comprises: a. an array of memory elements, defining at least one coordinate direction, which elements are simultaneously addressable at random in subarrays defined by at least one respective range of addresses along the at least one coordinate direction; b. at least one selection means for addressing a subarray defined by at least one respective desired range of addresses in at least one respective on of the at least one coordinate direction, each selection means comprising: i. respective input means for receiving upper and lower limit information defining said respective desired range; ii. a respective plurality of similarly-operating selection modules, arranged as nodes connecting branches in a vertical tree structure having a plurality of levels, each module being responsive to a part of said upper and lower limit information, each module corresponding to a respective module range of addresses, with the respective module range of addresses being smaller for modules at lower levels of the tree and having: A. a respective input for receiving an indication signal which provides a position indication for indicating a position of the part of the upper and lower limit information with respect to the respective module range of addresses, and B. a respective output means for supplying further indication signals such that in the modules at a lowest level of the tree structure the further indication signals are addressing signals for the memory elements in the subarray, and in the modules not at the lowest level of the tree structure the further indication signals are more specific position information for modules therebelow; whereby, granularity of selection of the memory elements is arbitrarily low; and c. a further selection module coupled above the highest level in the tree structure; the chips being further arranged so that each of the further selection modules is a node in a further tree structure analogous to the tree structure of the individual selection means, and so that the further tree structure is obtained exclusively by external wiring together of the chips.
Claim 10
Dependent Claim 349 words
Memory apparatus comprising: a plurality of chips arranged in rows and/or columns, each chip comprising a memory which comprises: a. an array of memory elements, defining at least one coordinate direction, which elements are simultaneously addressable at random in subarrays defined by at least one respective range of addresses along the at least one coordinate direction; b. at least one selection means for addressing a subarray defined by at least one respective desired range of addresses in at least one respective on of the at least one coordinate direction, each selection means comprising: i. respective input means for receiving upper and lower limit information defining said respective desired range; ii. a respective plurality of similarly-operating selection modules, arranged as nodes connecting branches in a vertical tree structure having a plurality of levels, each module being responsive to a part of said upper and lower limit information, each module corresponding to a respective module range of addresses, with the respective module range of addresses being smaller for modules at lower levels of the tree and having: A. a respective input for receiving an indication signal which provides a position indication for indicating a position of the part of the upper and lower limit information with respect to the respective module range of addresses, and B. a respective output means for supplying further indication signals such that in the modules at a lowest level of the tree structure the further indication signals are addressing signals for the memory elements in the subarray, and in the modules not at the lowest level of the tree structure the further indication signals are more specific position information for modules therebelow; whereby, granularity of selection of the memory elements is arbitrarily low; and c. a further selection module coupled above the highest level in the tree structure; the chips being further arranged so that each of the further selection modules is a node in a further tree structure analogous to the tree structure of the individual selection means, and so that the further tree structure is obtained exclusively by external wiring together of the chips.

References Cited (Backward Citations)

US3895360A Cited
US4106109A Cited
US4369504A Cited
SU826418A1 Cited
JPS5634179A Cited
JPS5798173A Cited
US4434502A Cited
US4725742A Cited
US4751684A Cited
JPH0629855A Cited
JPH0654055A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-07-03 1993-01-02 1993-07-04 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-07-03 1997-01-02 1997-07-04 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-07-03 2001-01-02 2001-07-04 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag