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

Content addressable discrete domain mass memory

Assignee: Nortel Networks Technology Corp
•
Filing: 1972-12-07
•
Granted: 1973-09-25
•
Expires: 1992-12-07
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A magnetic bubble mass memory which combines a plurality of storage loops with bubble logic to provide direct interrogation and manipulation of the stored information, without the requirement for external read and write access facilities associated with each loop. With random access, the memory can provide continuous output of the data information.

Inventors

  • 👤 W Kluge

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 21:43
CPC Classifications
G; G11; G11C; G11C15/00; G11C15/02; G11C19/00; G11C19/02; G11C19/08; G11C19/0875; G11C19/0883

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 183 words
A discrete domain memory arrangement comprising: a plurality of closed propagation loops each for sequentially circulating and storing a data word having a unique address and an information portion; an interrogation path for sequentially propagating data requests therealong having address and information portions coextensive with those contained in said loops; means for sequentially generating, in said interrogation path, a plurality of said data requests each having an address matching one of said unique addresses; means for periodically advancing the data words and requests along said loops and path respectively; means, associated with each loop, for sequentially comparing on a bit-by-bit basis the address within each loop to a specific address of one of said data requests being propagated along the interrogation path; and means responsive to the identification of a match between addresses in said comparing means, for replicating the information contained in the associated loop in the information portion of the word in the interrogation path; whereby sequential interrogation of a plurality of said loops results in the data words being continuously fed out from the interrogation path in the order requested.
Claim 2
Dependent Claim 183 words
A discrete domain memory arrangement comprising: a plurality of closed propagation loops each for sequentially circulating and storing a data word having a unique address and an information portion; an interrogation path for sequentially propagating data requests therealong having address and information portions coextensive with those contained in said loops; means for sequentially generating, in said interrogation path, a plurality of said data requests each having an address matching one of said unique addresses; means for periodically advancing the data words and requests along said loops and path respectively; means, associated with each loop, for sequentially comparing on a bit-by-bit basis the address within each loop to a specific address of one of said data requests being propagated along the interrogation path; and means responsive to the identification of a match between addresses in said comparing means, for replicating the information contained in the associated loop in the information portion of the word in the interrogation path; whereby sequential interrogation of a plurality of said loops results in the data words being continuously fed out from the interrogation path in the order requested.
Claim 3
Dependent Claim 147 words
A discrete domain memory arrangement comprising: a plurality of closed propagation loops each for sequentially circulating and storing a plurality of discrete domains that form a data word having a unique address and an information portion; means for sequentially generating a specific address of discrete domains; domain logic means, associated with each of said loops, for directly comparing the discrete domains of the address within each loop with that of said specific address; said domain logic means including means responsive to the identification of a match between two addresses for replicating the discrete domains of the information portion of the stored data word; and means for merging the generated address with the replicated information porTion of the stored data word in an output; whereby sequential interrogation of a plurality of said loops results in data words being continuously fed out from the path in the order requested.
Claim 4
Dependent Claim 147 words
A discrete domain memory arrangement comprising: a plurality of closed propagation loops each for sequentially circulating and storing a plurality of discrete domains that form a data word having a unique address and an information portion; means for sequentially generating a specific address of discrete domains; domain logic means, associated with each of said loops, for directly comparing the discrete domains of the address within each loop with that of said specific address; said domain logic means including means responsive to the identification of a match between two addresses for replicating the discrete domains of the information portion of the stored data word; and means for merging the generated address with the replicated information porTion of the stored data word in an output; whereby sequential interrogation of a plurality of said loops results in data words being continuously fed out from the path in the order requested.
Claim 5
Dependent Claim 60 words
A discrete domain memory arrangement as defined in claim 2 which additionally includes means for sequentially generating an information portion of discrete domains; and means responsive to the identification of a complete mismatch between two addresses for adding the generated information portion to that stored in the closed propagation loop; whereby the information in the closed propagation loop is modified.
Claim 6
Dependent Claim 104 words
A discrete domain memory arrangement comprising: a plurality of closed propagation loops each for storing a data word; means for generating an address unique to an address of the data word stored in one of said propagation loops; and logic means associated with each loop, for identifying a match between the address from said generating means and the address stored in said one loop, and in response thereto for replicating at an output, an information portion of the data word in said one loop; whereby sequential interrogation of said closed propagation loops results in data words being continuously fed out in the order requested.
Claim 7
Dependent Claim 104 words
A discrete domain memory arrangement comprising: a plurality of closed propagation loops each for storing a data word; means for generating an address unique to an address of the data word stored in one of said propagation loops; and logic means associated with each loop, for identifying a match between the address from said generating means and the address stored in said one loop, and in response thereto for replicating at an output, an information portion of the data word in said one loop; whereby sequential interrogation of said closed propagation loops results in data words being continuously fed out in the order requested.

References Cited (Backward Citations)

US3541522A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1976-09-24 1977-03-26 1977-09-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1980-09-24 1981-03-26 1981-09-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1984-09-24 1985-03-26 1985-09-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag