Content-Addressable Memory Error Control via Vector Segmentation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Content-addressable memory (CAM) devices face errors due to snapback behavior and device failures during matching processes, leading to false negatives and unreliable data retrieval.

Innovation Solution

The solution involves storing bit vectors across multiple columns, arrays, or memory devices as sets of bit subvectors, where each column, array, or memory device is associated with a different set of bit subvectors, and determining matches by segmenting received vectors into subvectors and feeding signals to multiple memory arrays or devices, ensuring that only a threshold number of correct matches indicate a valid match.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If bit vectors are stored in single memory cells, then storage capacity is maximized, but error rate increases due to snapback behavior and device failures

Engineering Contradiction:
Improvematch accuracyVSAvoidmemory structure
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments bit vectors into multiple bit subvectors and stores them across multiple columns, arrays, or memory devices. This segmentation distributes the storage burden and eliminates single-point failures, as errors in one segment do not invalidate the entire match result. The system reconstructs the original bit vector from matched subvectors to confirm complete matches.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent creates multiple copies of bit vector data across different memory locations (columns, arrays, or devices). By storing redundant copies, the system can tolerate failures in individual memory cells while maintaining data integrity. The matching process verifies consistency across multiple copies to identify valid matches.

Inventive Principle:
Principle #26Copying

2Measurement precision

If all bit vectors are matched against all stored vectors, then match accuracy is maximized, but processing time increases

Engineering Contradiction:
Improvematch verificationVSAvoidmatching process time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent divides the matching process into parallel operations on bit subvectors across multiple memory arrays. Instead of sequentially comparing entire bit vectors, the system simultaneously processes segments in parallel, dramatically reducing matching time while maintaining accuracy through threshold-based verification.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs partial matching by comparing only necessary bit subvectors rather than exhaustive full-vector comparisons. The threshold mechanism allows the system to stop processing when sufficient matches are confirmed, avoiding unnecessary comparisons and reducing overall processing time.

Inventive Principle:
Principle #16Partial or excessive action

3Quantity of substance

If memory cells are densely packed, then storage density is maximized, but error propagation increases when cells fail

Engineering Contradiction:
Improvestorage densityVSAvoiderror resistance
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

The patent segments stored data into distributed bit subvectors across multiple memory columns and arrays. This spatial segmentation ensures that dense packing does not create error propagation pathways, as failures in one densely-packed region affect only local subvectors rather than the entire data set.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies different quality requirements to different parts of the storage system. Critical match-determining subvectors are stored with higher redundancy across multiple arrays, while less critical portions use standard density. This local quality differentiation maintains overall reliability while preserving storage efficiency.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS11789797B2Error control for content-addressable memory
Publication Date: 2023.10.17 MICRON TECHNOLOGY INC
  • US11789797B2 patent drawing
  • US11789797B2 patent drawing
  • US11789797B2 patent drawing

AI summary

Methods, systems, and devices for error control for content-addressable memory (CAM) are described. A CAM may store bit vectors as a set of subvectors, which each subvector stored in an independent aspect of the CAM, such as in a separate column or array of memory cells within the CAM. The CAM may similarly segment a queried input bit vector and identify, for each resulting input subvector, whether a matching subvector is stored by the CAM. The CAM may identify a match for the input bit vector when the number of matching subvectors satisfies a threshold. The CAM may validate a match based on comparing a stored bit vector corresponding to the identified match to the input bit vector. The stored bit vector may undergo error correction and may be stored in the CAM or another memory array, such as a dynamic random access memory (DRAM) array.