Static information storage and retrieval – Associative memories – Ferroelectric cell
Reexamination Certificate
2000-12-13
2002-11-19
Nelms, David (Department: 2818)
Static information storage and retrieval
Associative memories
Ferroelectric cell
C365S042000, C365S189011, C365S230010, C711S108000
Reexamination Certificate
active
06483732
ABSTRACT:
BACKGROUND
The present invention relates to electronic circuitry, and more particularly, but not exclusively, relates to relational logic for a content addressable memory.
Content addressable memory (CAM) is used in many different applications, such as redundant “back-up” memory systems for Application Specific Integrated Circuits (ASICs), associative caches, and databases. In common use, an input is compared to each CAM memory location and any matches are identified. Some systems have incorporated schemes to provide relational information as an alternative or addition to match status. Unfortunately these schemes typically involve the addition of a significant amount of circuitry and/or processing time. Accordingly, there is a demand for further advancements relating to CAM technology. The present invention satisfies this demand and has other benefits and advantages.
SUMMARY OF THE INVENTION
One embodiment of the present invention is a unique content addressable memory system. Other embodiments include unique devices and methods involving relational operations for a content addressable memory.
In a further embodiment, a Content Addressable Memory (CAM) device includes unique logic to provide an indication corresponding to an inequality between an input and one or more locations. The inequality corresponds to a greater-than, greater-than-or-equal-to, less-than, or less-than-or equal-to relational operation.
Another form of the present application includes a number of content addressable memory cells and a number of relational logic circuits. The circuits each compare a stored bit of one of the cells to a respective bit of an input word. The relational logic circuits each include a selection operator to route a first signal input to a respective output if the stored bit and respective bit are equal and to route a second signal representative of a relational inequality between the word and data stored in the cells to the output if the stored bit and the respective bit are unequal.
In another embodiment of the present invention, an apparatus includes a number of content addressable memory cells and a number of relational logic circuits each corresponding to a different one of the cells. Each one of these circuits is coupled to another by a corresponding one of a number of relational signal pathways, and each include a device with an input coupled to one of these pathways and an output coupled to another of these pathways to selectively pass a signal from the input to the output in response to a control signal.
Yet another embodiment comprises operating a content addressable memory that includes a multibit storage location, first relational logic corresponding to a most significant bit of the location, and second relational logic corresponding to a next most significant bit of the location. A multibit input to the memory is provided and a first signal is selected for output with the first relational logic if a first bit of the input and the most significant bit of the location are different. A second signal is selected for output with the first relational logic if the first bit of the input and the most significant bit of the location are equal. This second signal is received from the second relational logic.
Accordingly, one object of the present invention is to provide a unique content addressable memory.
Another object is to provide a unique system, method, or apparatus directed to relational operation of a content addressable memory.
REFERENCES:
patent: 3601812 (1971-08-01), Weisbecker
patent: 4153943 (1979-05-01), Anderson
patent: 4162535 (1979-07-01), Anderson
patent: 4283771 (1981-08-01), Chang
patent: 4376974 (1983-03-01), Stewart et al.
patent: 4996666 (1991-02-01), Duluk, Jr.
patent: 5258946 (1993-11-01), Graf
patent: 5444649 (1995-08-01), Nemirovsky
patent: 5475794 (1995-12-01), Mashiko
patent: 5502832 (1996-03-01), Ali-Yahia et al.
patent: 5592142 (1997-01-01), Adams et al.
patent: 5694406 (1997-12-01), Lipovski
patent: 5796758 (1998-08-01), Levitan
patent: 5930161 (1999-07-01), Sheikholeslami
patent: 5953714 (1999-09-01), Abdullah
patent: 6137707 (2000-10-01), Srinivasan et al.
patent: 6161164 (2000-12-01), Dhong et al.
Koninklijke Philips Electronics , N.V.
Nelms David
Yoha Connie C.
Zawilski Peter
LandOfFree
Relational content addressable memory does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Relational content addressable memory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relational content addressable memory will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2991430