Testing ReRAM-based TCAM for Computation-in-Memory Applications

Computation in memory (CiM) can potentially mitigate the high energy and latency associated with the back-and-forth data transfer between the processor core and memory sub-systems. This bottleneck is known as the memory wall problem and is further pressed by data-intensive applications. Measuring the similarity between two binary patterns is a data-intensive, highly frequent kernel in many modern applications that can be accelerated using the CiM concept. Content addressable memory (CAM) and its ternary version (TCAM) are the specific CiM blocks for the task of binary pattern similarity measurements. The performance and energy efficiency of the TCAM can be further improved by utilizing the emerging resistive non-volatile memory (NVM). Among different NVM technologies, redox-based RAM (ReRAM) is a promising candidate to be implemented within the NVM-based TCAM, mainly due to its highly distinct resistive levels. Besides the performance and energy benefits of the ReRAM-based TCAM (ReTCAM), its high functional quality is of utmost importance and needs to be carefully taken into account. More specifically, the co-integration of the ReRAM and transistor technologies results in new fault behaviors. To assure the high quality of the ReTCAM, in this paper, we aim to develop a March-like test algorithm tailored for ReTCAM array. The proposed March-like test algorithm is extendable and can achieve 100% fault coverage.

Authors

Institutions

Publication Details

Published
2024-10-14
DOI
https://doi.org/10.1109/dttis62212.2024.10780399
Citations
2
Primary Topic
VLSI and Analog Circuit Testing
Type
article
Field-Weighted Citation Impact
0.98
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Testing ReRAM-based TCAM for Computation-in-Memory Applications

Mahta Mayahinia, Mehdi B. Tahoori, Haneen G. Hezayyin
2 citations
VLSI and Analog Circuit Testing
0.98
article

Testing ReRAM-based TCAM for Computation-in-Memory Applications

Mahta Mayahinia, Mehdi B. Tahoori, Haneen G. Hezayyin
article en
2 citations

Abstract

Computation in memory (CiM) can potentially mitigate the high energy and latency associated with the back-and-forth data transfer between the processor core and memory sub-systems. This bottleneck is known as the memory wall problem and is further pressed by data-intensive applications. Measuring the similarity between two binary patterns is a data-intensive, highly frequent kernel in many modern applications that can be accelerated using the CiM concept. Content addressable memory (CAM) and its ternary version (TCAM) are the specific CiM blocks for the task of binary pattern similarity measurements. The performance and energy efficiency of the TCAM can be further improved by utilizing the emerging resistive non-volatile memory (NVM). Among different NVM technologies, redox-based RAM (ReRAM) is a promising candidate to be implemented within the NVM-based TCAM, mainly due to its highly distinct resistive levels. Besides the performance and energy benefits of the ReRAM-based TCAM (ReTCAM), its high functional quality is of utmost importance and needs to be carefully taken into account. More specifically, the co-integration of the ReRAM and transistor technologies results in new fault behaviors. To assure the high quality of the ReTCAM, in this paper, we aim to develop a March-like test algorithm tailored for ReTCAM array. The proposed March-like test algorithm is extendable and can achieve 100% fault coverage.

Karlsruhe Institute of Technology (DE)
Openalex Percentile: Top 23%
VLSI and Analog Circuit Testing
0.98
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.