# US 2019/0378572 A1 · Array organization and architecture to perform range-match operations with content addressable memory (cam) circuits

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0378572 A1
- Document ID: US20190378572A1
- Status: Published application
- Kind: A1
- Application number: 16/548,477
- Filed: 2019-08-22
- Published: 2019-12-12
- Earliest claimed: 2014-01-06
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: John E. BARTH, JR.; Dean L. LEWIS
- Web page: https://patentgrep.com/patent/US20190378572A1

## CPC

- G11C 15/046: {using non-volatile storage elements}
- G11C 15/00: Digital stores in which information comprising one or more characteristic parts is written into the store and in which information is read-out by searching for one or more of these characteristic parts, i.e. associative or content-addressed stores
- G11C 15/04: using semiconductor elements
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

An array organization and architecture for a content addressable memory (CAM) system. More specifically, a circuit is provided for that includes a first portion of the CAM configured to perform a first inequality operation implemented between 1 to n CAM entries. The circuit further includes a second portion of the CAM configured to perform a second inequality operation implemented between the 1 to n CAM entries. The first portion and the second portion are triangularly arranged side by side such that the first inequality operation and the second inequality operation are implemented between the 1 to n CAM entries using the same n wordlines.

## Claims

### Claim 1

A circuit comprising:
a content addressable memory (CAM) configured to perform a first inequality operation implemented between 1 to n CAM entries,
wherein two valid bits are provided for each of the 1 to n CAM entries as extra bits, in addition to data bits defining each of the 1 to n CAM entries, to indicate that the data bits defining each of the 1 to n CAM entries comprise a valid pattern.

### Claim 2 (depends on 1)

The circuit of claim 1, wherein the CAM is n+1 bits wide.

### Claim 3 (depends on 1)

The circuit of claim 1, wherein, for each 1 to n CAM entry, the two valid bits, indicating that the data bits defining each of the 1 to n CAM entries comprise a valid pattern, are latched in a latch circuit.

### Claim 4 (depends on 3)

The circuit of claim 3, wherein the latch circuit is coupled to a precharge driver for a matchline such that the matchline will only be precharged when the two valid bits for a corresponding one of the 1 to n CAM entries are latched in the latch circuit.

### Claim 5 (depends on 1)

The circuit of claim 1, further comprising:
a first portion of the content addressable memory (CAM) configured to perform the first inequality operation implemented between the 1 to n CAM entries, wherein the 1 to n CAM entries of the first portion are read from left to right to perform the first inequality operation.

### Claim 6 (depends on 5)

The circuit of claim 5, further comprising:
a second portion of the CAM configured to perform a second inequality operation implemented between the 1 to n CAM entries, wherein the 1 to n CAM entries of the second portion are read from right to left to perform the second inequality operation.

### Claim 7 (depends on 6)

The circuit of claim 6, wherein the second portion is flipped 180° relative to the first portion.

### Claim 8 (depends on 7)

The circuit of claim 7, wherein the CAM is n+1 bits wide.

### Claim 9 (depends on 7)

The circuit of claim 7, wherein the CAM includes an additional row per pair of the first inequality operation and the second inequality operation.

### Claim 10 (depends on 7)

The circuit of claim 7, wherein the circuit is implemented on a semiconductor chip.

### Claim 11 (depends on 7)

The circuit of claim 7, wherein the first inequality operation is a less-than or greater-than operation, and the second inequality operation is a less-than or greater-than operation.

### Claim 12 (depends on 7)

The circuit of claim 7, wherein a first output of the first portion and a second output of the second portion are ANDed together to produce a range-match function.

### Claim 13 (depends on 7)

The circuit of claim 7, further comprising:
a first matchline configured to indicate a match or mismatch for each of the 1 to n CAM entries implemented in the first portion; and
a second matchline configured to indicate a match or mismatch for each of the 1 to n CAM entries implemented in the second portion.

### Claim 14 (depends on 13)

The circuit of claim 13, wherein the first portion and the second portion are triangularly arranged side by side such that the first inequality operation and the second inequality operation are implemented between the 1 to n CAM entries using the same n wordlines.
