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

Information store system comprising a plurality of different shift-registers

Assignee: Individual
•
Filing: 1975-06-03
•
Granted: 1977-06-07
•
Expires: 1995-06-03
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The invention provides for a store comprising a plurality of store sections. Each section comprises a plurality of block shift-registers. Each block shift-register in a section can have characteristics different from the other ones. One of those block shift-registers is a high speed shift-register and accordingly, the blocks contained therein can be accessed with a high speed.

Inventors

  • 👤 Joseph Nageeb Tasso

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 18:10
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/38; G06F13/42; G06F13/4204; G06F13/4234; G06F13/4243; G11; G11C; G11C19/00

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 140 words
For a program controlled information processing system operating on multi-data blocks, a large capacity store comprising: a plurality of addressable memory sections, each having simultaneously controllable bit shift-registers equal in number to the number of bits in a data block to constitute a data-block shift-register of addressable block line positions and being individually controllable for a step by step operation; each said data block shift-register in a memory section being comprised of elementary block shift-registers or fragments having different characteristics, those fragments being selectively serially connectable or adapted to be looped; read-write means associated with at least one of said fragments; closing means associated with said at least one fragment in order to form a closed loop; switching and synchronizing means provided in order to form an overall closed loop with said at least one fragment and the other ones.
Claim 2
Dependent Claim 140 words
For a program controlled information processing system operating on multi-data blocks, a large capacity store comprising: a plurality of addressable memory sections, each having simultaneously controllable bit shift-registers equal in number to the number of bits in a data block to constitute a data-block shift-register of addressable block line positions and being individually controllable for a step by step operation; each said data block shift-register in a memory section being comprised of elementary block shift-registers or fragments having different characteristics, those fragments being selectively serially connectable or adapted to be looped; read-write means associated with at least one of said fragments; closing means associated with said at least one fragment in order to form a closed loop; switching and synchronizing means provided in order to form an overall closed loop with said at least one fragment and the other ones.
Claim 3
Dependent Claim 55 words
A large capacity store according to claim 1 wherein the shift-register forming a section is constituted of a first shift-register or fragment having a low capacity and a very high shifting speed, this first shift-register comprising read-write means, and of a second shift-register or fragment having a large capacity and being of the dynamic type.
Claim 4
Dependent Claim 46 words
A large capacity store according to claim 2 wherein the second shift-register is of the CCD type including regeneration cells and comprising means for a to-and-fro refreshment, the amplitude of the to-and-fro refreshment oscillations being sufficient for all the regeneration cells to refresh all the data.
Claim 5
Dependent Claim 50 words
A store according to claim 1, wherein means are provided for enabling said fragments to be looped alone, according to a small set, or all together, and wherein switching and synchronizing means are provided for combining said fragments according to the original order of the data contained in said fragments.
Claim 6
Dependent Claim 47 words
A store according to claim 1, wherein a follower means is associated with each useful loop capable of being formed by selectively connecting said fragments constituting the memory sections, each said follower means tracking the position of data blocks in the loop with which it is associated.
Claim 7
Dependent Claim 66 words
A store according to claim 1, wherein a first clock means is associated with each fragment of shift-register, said first clock means permitting operation of each shift-register fragment at its maximum shifting speed, and wherein a second clock means is associated with each fragment or combination of fragments comprising dynamic shift-registers, said second clock means functioning to shift said dynamic shift-registers at their optimum refreshment speed.
Claim 8
Dependent Claim 63 words
A store according to claim 2, further comprising: a first clock means associated with said first high speed shift-register, a second and a third clock means associated with said second dynamic shift-register, said second clock means functioning to shift the second shift-register at its maximum shifting speed, and said third clock means functioning to refresh said second shift-register at its optimum refreshment speed.
Claim 9
Dependent Claim 86 words
A store according to claim 7 comprising: a first follower means associated with a first loop formed by closing the first shift-register on itself, a second follower means associated with a second loop constituted by closing the second shift register on itself, and a third follower means associated with a third loop constituted by the serial connection of the first and the second shift-registers, said first, second and third follower means tracking the position of data blocks in the loops with which they are respectively associated.
Claim 10
Dependent Claim 125 words
A store according to claim 8 comprising: means for carrying out a seeking of a block on said third loop for shifting a requested block in front of the read-write means of the first fragment, means for forming the first and second loops, the follower means of said first and second loops being at a zero value, means for storing the contents of the follower of the third loop, switching means for forming the third loop from the first and second loops once the contents of the follower means of the first and second loops are at the zero value, that is the value that those follower means indicated at the time of the formation of the first and second loops from the third loop.
Claim 11
Dependent Claim 27 words
A store according to claim 1, wherein one or more of the shift-register fragments comprise a parallel access to one or more blocks for reading and/or writing.
Claim 12
Dependent Claim 45 words
A store according to claim 5, further comprising means for memorizing the content of the follower means associated with the non-formed loops or the static loops of a section, whereby those followers can be used in connection with the respective corresponding loops of another section.

References Cited (Backward Citations)

US3778778A Cited
US3781819A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1980-06-06 1980-12-06 1981-06-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1984-06-06 1984-12-06 1985-06-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1988-06-06 1988-12-06 1989-06-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag