An Efficient Single-Cell Associative Search Engine via Conditional Execution

Content addressable memories (CAMs) embed parallel associative search directly into memory blocks, making them essential for associative memory (AM) applications. CAMs can efficiently perform best or exact search operations that identify a data entry in the database that is the closest or exactly the same as the input entry, respectively. Recently, a single FeFET-based design that is compact and highly efficient has been proposed. However, its multi-step sensing scheme is tailored for best search and is thus inefficient for exact search operations. To address this, we propose a sensing scheme with the concept of conditional execution that dynamically prunes execution steps according to the outputs of the early steps. For higher efficiency, we implement the proposed sensing scheme in the voltage domain and propose an efficient transformation scheme to support current domain arrays. The proposed scheme achieves up to 3.66× and 3× lower energy and latency respectively. The proposed method also achieves a 2.5× lower error rate.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1109/iseda65950.2025.11101646
Primary Topic
DNA and Biological Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Single-Cell Associative Search Engine via Conditional Execution

Cheng Zhuo, Xunzhao Yin, Jiayi Wang, Yan Zhang et al.
DNA and Biological Computing
article

An Efficient Single-Cell Associative Search Engine via Conditional Execution

Cheng Zhuo, Xunzhao Yin, Jiayi Wang, Yan Zhang, Zeyu Yang, Yu Qian
article en

Abstract

Content addressable memories (CAMs) embed parallel associative search directly into memory blocks, making them essential for associative memory (AM) applications. CAMs can efficiently perform best or exact search operations that identify a data entry in the database that is the closest or exactly the same as the input entry, respectively. Recently, a single FeFET-based design that is compact and highly efficient has been proposed. However, its multi-step sensing scheme is tailored for best search and is thus inefficient for exact search operations. To address this, we propose a sensing scheme with the concept of conditional execution that dynamically prunes execution steps according to the outputs of the early steps. For higher efficiency, we implement the proposed sensing scheme in the voltage domain and propose an efficient transformation scheme to support current domain arrays. The proposed scheme achieves up to 3.66× and 3× lower energy and latency respectively. The proposed method also achieves a 2.5× lower error rate.

Zhejiang University (CN)
Openalex Percentile: Top 82%
DNA and Biological Computing
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.