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

Associative memory system

Assignee: Shell USA Inc
•
Filing: 1982-04-29
•
Granted: 1984-06-26
•
Expires: 2002-04-29
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An associative memory system for retrieving a key word related to a code word comprising a first random access memory which can be read from and written into and is sized to accommodate at least m address-bits and a second random access memory means which can be read from and written into and is sized to accommodate at least (n+p) address-bits. An addressing means is connected to the first and second memory means for providing a first portion of m bits of the code word to the first memory means and a second portion of n bits of the code word to the second memory means. The first memory means is adapted to provide a response word of p bits to the second memory means if the first memory means determines that the first portion of the code word corresponds to a word stored in said first memory means. The second memory means is adapted to provide the key word on an output line if the second memory means determines that a combination of the n and p bits corresponds to a word stored in said second memory means.

Inventors

  • 👤 Patric Savage

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 22:17
CPC Classifications
G; G11; G11C; G11C15/00; G11C15/04

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 192 words
An associative memory system for retrieving a key word related to a code word, said memory system comprising: a first random access memory means which can be read from and written into and is sized to accommodate at least m address-bits; a second random access memory means which can be read from and written into and is sized to accommodate at least (n+p) address-bits; and addressing means connected to said first and second memory means for providing a first portion of m bits of said code word, to said fist memory means and a second portion of n bits of said code word to said second memory means, said first memory means being adapted to provide a response word of p bits to said second memory means if said first memory means determines that said first portion of said code word corresponds to a word stored in said first memory means and said second memory means is adapted to provide said key word on an output line if said second memory means determines that a combination of said n and p address-bits corresponds to a word stored in said second memory means.
Claim 2
Dependent Claim 192 words
An associative memory system for retrieving a key word related to a code word, said memory system comprising: a first random access memory means which can be read from and written into and is sized to accommodate at least m address-bits; a second random access memory means which can be read from and written into and is sized to accommodate at least (n+p) address-bits; and addressing means connected to said first and second memory means for providing a first portion of m bits of said code word, to said fist memory means and a second portion of n bits of said code word to said second memory means, said first memory means being adapted to provide a response word of p bits to said second memory means if said first memory means determines that said first portion of said code word corresponds to a word stored in said first memory means and said second memory means is adapted to provide said key word on an output line if said second memory means determines that a combination of said n and p address-bits corresponds to a word stored in said second memory means.
Claim 3
Dependent Claim 52 words
An associative memory system as recited in claim 1, wherein said associative memory system is adapted to store a predetermined maximum number of code words and associated key words, said predetermined maximum number of code words being capable of being addressed in p address-bits, and said m being greater than said p.
Claim 4
Dependent Claim 76 words
An associative memory system as recited in claims 1 or 2 further comprising a first means connected to said first memory means to indicate when said m bits do not correspond to a word that is stored in said first memory means and a second means connected to said second memory means to indicate when said combination of n and p bits do not correspond to a word that is stored in said second memory means.
Claim 5
Dependent Claim 39 words
An associative memory system as recited in claim 3, wherein said m bits of said first portion and said n bits of said second portion of said code word comprises the total number of bits in said code word.

References Cited (Backward Citations)

US4385371A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1987-06-26 1987-12-26 1988-06-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1991-06-26 1991-12-26 1992-06-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1995-06-26 1995-12-26 1996-06-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag