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

Associative memory architecture

Assignee: Gula Consulting LLC
•
Filing: 1993-01-28
•
Granted: 1996-03-26
•
Expires: 2013-01-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An association memory which permits the execution of all kinds of comparative operations. The associative memory includes a memory map (1) in which a search argument, which has been processed in a scanning module (3) and a masking unit (5,7), is compared to the data stored in the memory. After this comparison, the data obtained is recorded in a response register (11). When the search data and the stored data supply an association of variable length words, the result data is processed in a module for the processing of variable-length words (13) and in a multiple-response management module.

Inventors

  • 👤 Tahar Ali-Yahia
  • 👤 Michel Dana

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-02 07:30
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/903; G06F16/90335; G06F16/90339

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 250 words
An associative memory allowing for the comparison of search data with a multiplicity of data stored in at least one data register and available at the outpupts of said data register, comprising: Comparison means (1, 3, 5, and 7) with inputs connected to the outputs of the data register for processsing the search data and comparing the search data with the stored data, these comparison means supplying result data at no less than one output, said comparison means including a masking unit, a preprocessing unit, and a memory map, said preprocessing unit generating, on the basis of the search data, comparison data to execute a plurality of comparison functions in the memory map, said masking unit being connected to an output of the preprocessing unit and to an input of the memory map and being operable to mask at least one part of a word of a comparison datum so that the unmasked part of the word is compared, in the memory map, with the corresponding parts of the words of the stored data; Manipulation means with at least one input connected to the output of the comparison means for processing the result data obtained after comparison of the search data with the stored data; A control unit (21) to control information exchanges between the comparison means and the manipulation means, wherein the manipulation means include a processing unit for variable-length word associations (13), each search datum and stored datum, including a word or an association of variable length words.
Claim 2
Dependent Claim 250 words
An associative memory allowing for the comparison of search data with a multiplicity of data stored in at least one data register and available at the outpupts of said data register, comprising: Comparison means (1, 3, 5, and 7) with inputs connected to the outputs of the data register for processsing the search data and comparing the search data with the stored data, these comparison means supplying result data at no less than one output, said comparison means including a masking unit, a preprocessing unit, and a memory map, said preprocessing unit generating, on the basis of the search data, comparison data to execute a plurality of comparison functions in the memory map, said masking unit being connected to an output of the preprocessing unit and to an input of the memory map and being operable to mask at least one part of a word of a comparison datum so that the unmasked part of the word is compared, in the memory map, with the corresponding parts of the words of the stored data; Manipulation means with at least one input connected to the output of the comparison means for processing the result data obtained after comparison of the search data with the stored data; A control unit (21) to control information exchanges between the comparison means and the manipulation means, wherein the manipulation means include a processing unit for variable-length word associations (13), each search datum and stored datum, including a word or an association of variable length words.
Claim 3
Dependent Claim 102 words
An associative memory in accordance with claim 1, wherein the preprocessing unit includes, first, a shift register (31) connected to an output of the data register and to an input of the control unit, a bit counter (32) connected to an output of the control unit and a decoder (33) connected to an output of the bit counter; and second, an address register (35) connected to the output of the data register, and an exclusive OR (XOR) logic gate (36) connected to an output of the address register and to an output of the decoder in order to supply the comparison datum.
Claim 4
Dependent Claim 91 words
An associative memory in accordance with claim 1, wherein the preprocessing unit includes, first, a shift register (31) connected to an output of the data register and to an input of the control unit, and a second shift register (34) connected to an output of the control unit; and an address register (35) connected to the output of the data register, and an exclusive OR (XOR) logic gate (36) connected to an output of the address register and to an output of the second shift register to supply the comparison datum.
Claim 5
Dependent Claim 96 words
An associative memory in accordance with claim 1, wherein the association processing unit includes a module for processing words (13) to manage a dialogue between the words of one and the same association, each word of an association having a position field indicating the position of the word in the association, and a result field indicating the result of the comparison of the word of the search datum with the words of the stored data; the management of the dialogue is carried out as a function of the indications contained in the position and result fields.
Claim 6
Dependent Claim 30 words
An associative memory in accordance with claim 1, wherein the processing unit also includes a multiple response management module (15) to generate an address for each of the result data.

References Cited (Backward Citations)

US4257110A Cited
US4959811A Cited
US4888731A Cited
US4928260A Cited
US4996666A Cited
EP0380294A1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-03-26 1999-09-25 2000-03-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-03-26 2003-09-25 2004-03-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-03-26 2007-09-25 2008-03-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag