LFSR-Based Error-Resilient Ternary Content-Addressable Memory for High-Speed Fault-Tolerant Data Storage and Search

Content-addressable memories provide fast parallel lookup but remain vulnerable to storage faults, synchronization errors, and implementation overhead when realized using SRAM-based structures. This work presents an Error-Resilient Ternary Content-Addressable Memory (ER-TCAM) that incorporates Linear Feedback Shift Registers (LFSRs) for randomized address generation and synchronized memory access. The proposed architecture combines LFSR-based storage, an address generation unit, a read/write controller, bit-wise error detection, and an Error Correction Vector (ECV) computation unit. The error-detection path generates an encoded indication of the faulty LFSR word, while the correction path reconstructs and rewrites the corresponding error-correction information without preventing lookup activity. The design was modeled in Verilog and implemented using Xilinx ISE 14.2. The supplied synthesis results report 32 slice registers, 128 LUTs, 16 fully used LUT-FF pairs, a delay of 0.316 ns, and power consumption of 0.042 W. The reported simulation also demonstrates recovery of an error-corrupted stored value to the correct output. Comparative results against DyTAN, MTCAM, and CN-TCAM show lower resource use, delay, and power for the proposed ER-TCAM.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-16
DOI
https://doi.org/10.5281/zenodo.22783122
Primary Topic
Network Packet Processing and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

LFSR-Based Error-Resilient Ternary Content-Addressable Memory for High-Speed Fault-Tolerant Data Storage and Search

T. Leelavathi, Abdul Maqseed Shaik, Nadikudi Anusha
Zenodo (CERN European Organization for Nuclear Research)
Network Packet Processing and Optimization
article

LFSR-Based Error-Resilient Ternary Content-Addressable Memory for High-Speed Fault-Tolerant Data Storage and Search

T. Leelavathi, Abdul Maqseed Shaik, Nadikudi Anusha
article en

Abstract

Content-addressable memories provide fast parallel lookup but remain vulnerable to storage faults, synchronization errors, and implementation overhead when realized using SRAM-based structures. This work presents an Error-Resilient Ternary Content-Addressable Memory (ER-TCAM) that incorporates Linear Feedback Shift Registers (LFSRs) for randomized address generation and synchronized memory access. The proposed architecture combines LFSR-based storage, an address generation unit, a read/write controller, bit-wise error detection, and an Error Correction Vector (ECV) computation unit. The error-detection path generates an encoded indication of the faulty LFSR word, while the correction path reconstructs and rewrites the corresponding error-correction information without preventing lookup activity. The design was modeled in Verilog and implemented using Xilinx ISE 14.2. The supplied synthesis results report 32 slice registers, 128 LUTs, 16 fully used LUT-FF pairs, a delay of 0.316 ns, and power consumption of 0.042 W. The reported simulation also demonstrates recovery of an error-corrupted stored value to the correct output. Comparative results against DyTAN, MTCAM, and CN-TCAM show lower resource use, delay, and power for the proposed ER-TCAM.

Zenodo (CERN European Organization for Nuclear Research)
Grammar School (SK)
Openalex Percentile: Top 6%
Network Packet Processing and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.