US3609702A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Associative memory
Assignee: International Business Machines Corp
•
Filing: 1968-10-23
•
Granted: 1971-09-28
•
Expires: 1988-10-23
Abstract
Abstract This invention relates to an associative memory for the storage of digital data in which each word location of the memory is provided with two or more match triggers. Mans is provided for registering matches or mismatches in a selected trigger and for controlling operations on the memory in response to the contents of a selected trigger. Several operations are described which use the plural triggers.
Inventors
- 👤 Peter A E Gardner
- 👤 Michael H Hallett
- 👤 Peter J Titman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 18:40
CPC Classifications
G; G11; G11C; G11C15/00; G11C15/04
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
72 words
An associative memory of the type having means for comparing bit positions of words of the memory with predetermined bit values and producing for each word a signal signifying a relationship between the word and said predetermined bit values, wherein the improvement comprises, for each word a plurality of means to store said signals and separate selection means for enabling a selected one of said signal storing means to receive said signal.
Claim 2
Dependent Claim
72 words
An associative memory of the type having means for comparing bit positions of words of the memory with predetermined bit values and producing for each word a signal signifying a relationship between the word and said predetermined bit values, wherein the improvement comprises, for each word a plurality of means to store said signals and separate selection means for enabling a selected one of said signal storing means to receive said signal.
Claim 3
Dependent Claim
37 words
An associative memory as defined in claim 1, wherein the selection means includes means to set to the predetermined state a selected device of the plurality associated with a word location adjacent a word generating the signal.
Claim 4
Dependent Claim
47 words
An associative memory as defined in claim 1, including accessing means for transferring data from any word location marked by having a selected device of the associated plurality in a predetermined stable state to an output register and from an input register to any marked word store.
Claim 5
Dependent Claim
79 words
An associative memory as defined in claim 3, including a multiorder mask register, each order of which includes means to determine if, upon operation of the comparison means, a comparison is to take place between data of the same order of the input register and of the words and if, upon operation of the accessing means, a data transfer is to take place between the same order of any marked word store and of the input or output registers.
Claim 6
Dependent Claim
90 words
An associative memory as defined in claim 4, in which each order of the mask register includes a mask trigger and includes means for preventing, upon operation of the comparison means, comparison between the same order of the input register and of the word stores if the mask trigger is in one stable stage, and for preventing, upon operation of the accessing means, data transfer between the same order of any marked word store and of the input or output register if the trigger is in the other bistable state.
Claim 7
Dependent Claim
27 words
An associative memory as defined in claim 4 including means for rendering the mask register ineffective to control comparison or accessing of data in the word stores.
Claim 8
Dependent Claim
22 words
An associative memory as defined in claim 6, with means for transferring data from any marked word store to the mask triggers.
Claim 9
Dependent Claim
79 words
An associative memory as defined in claim 1 in which each order of each word comprises a data storage cell having three stable states, a first stable state representing a binary zero, a second stable state representing a binary one, and a third stable state which is such as not to prevent generation of the match signal by the word store upon operation of the comparison means whatever the data content of the corresponding order of the input register.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1974-09-27 | 1975-03-29 | 1975-09-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1978-09-27 | 1979-03-29 | 1979-09-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1982-09-27 | 1983-03-29 | 1983-09-28 | $7700.00 | Window Closed / Lapsed |