On-Access Error Correction in Certain Types of Content-Addressable Memories
IEEE Transactions on Information Theory · 2026-08 · 72 (8) · 5543-5555
DOI: 10.1109/tit.2026.3695789 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-08. Verfasst von Ron M. Roth und 1 weiteren Autor:innen. Die Arbeit nennt 24 Literaturangaben. Gefördert von: Hewlett Packard Laboratories, Milpitas, CA, USA, Army Research Office, Israel Science Foundation.
Abstract (Originalsprache)
A summing content-addressable memory ( $\Sigma $ -CAM) is a device which consists of an $\ell \times n$ array of cells, where each cell can be programmed to one of two states, 0 or 1. The input to the array is a binary $\ell $ -vector, and the output is an integer $n$ -vector whose entries are the Hamming distances between the input vector and the contents of the cells along each of the $n$ columns in the array. An ordinary binary CAM can be seen as a quantized $\Sigma $ -CAM where the output at each column is just an indicator whether the Hamming distance is 0 (full match) or not. A summing ternary CAM ( $\Sigma $ -TCAM) is a variant of a $\Sigma $ -CAM where the state/input alphabet is endowed with a third symbol (“don’t care”) whose Hamming distance from any symbol is defined to be 0. In this work, several coding schemes are presented for on-access correction of errors in both $\Sigma $ -CAMs and $\Sigma $ -TCAMs. All schemes entail allocating several columns in the array for redundancy such that, when an input vector is applied to the array, errors in the output vector can be corrected, provided that their number (measured by either the Hamming metric or the $L_{1}$ -metric) does not exceed a prescribed value. In the case of $\Sigma $ -CAMs, the operation of the array resembles that of a discrete vector–matrix multiplier; therefore, the presented error-correction schemes for $\Sigma $ -CAMs build upon schemes that have been proposed for such multipliers. The adaptation of such schemes to $\Sigma $ -TCAMs, however, is more involved due to the don’t care symbol: the schemes in this case make use of a special type of positional binary representation of integer pairs where the representations of the two integers in a pair do not share a 1 in the same position.
Förderung
- Hewlett Packard Laboratories, Milpitas, CA, USA
- Army Research Office
- Israel Science Foundation
Zitieren
APA
Roth, R. M., & Pedretti, G. (2026). On-Access Error Correction in Certain Types of Content-Addressable Memories. IEEE Transactions on Information Theory, 72(8), 5543-5555. https://doi.org/10.1109/tit.2026.3695789
Vancouver
Roth RM, Pedretti G. On-Access Error Correction in Certain Types of Content-Addressable Memories. IEEE Transactions on Information Theory. 2026;72(8):5543-5555. doi:10.1109/tit.2026.3695789
BibTeX
@article{Roth2026,
author = {Roth, Ron M. and Pedretti, Giacomo},
title = {On-Access Error Correction in Certain Types of Content-Addressable Memories},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {8},
pages = {5543--5555},
doi = {10.1109/tit.2026.3695789}
}
EUVIMED