A Low-Complexity Sensing Scheme for Approximate Matching Content-Addressable Memory

被引:4
|
作者
Garzon, Esteban [1 ]
Golman, Roman [2 ]
Lanuzza, Marco [1 ]
Teman, Adam [2 ]
Yavits, Leonid [2 ]
机构
[1] Univ Calabria, Dept Comp Engn Modeling Elect & Syst Engn, I-87036 Arcavacata Di Rende, Rende, Italy
[2] Bar Ilan Univ, Fac Engn, EnICS Labs, IL-5290002 Ramat Gan, Israel
关键词
HD-CAM; hamming distance; contentaddressable memory; approximate CAM; approximate match; matchline sense amplifier; TERNARY CAM;
D O I
10.1109/TCSII.2023.3286257
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The need for approximate rather than exact search arises in numerous compare-intensive applications, from networking to computational genomics. This brief presents a novel sensing approach for approximate matching content-addressable memory (CAM) designed to handle large Hamming distances (HDs) between the query pattern and stored data. The proposed matchline sensing scheme (MLSS) employs a replica mechanism and a 12-transistor positive feedback sense amplifier to effectively resolve the approximate match operation. The MLSS was integrated into a 4 kB approximate CAM array and fabricated in a 65 nm CMOS technology. With an overall area footprint of 0.0048 mm(2), which includes 512 sense amplifiers and the replica mechanism, the MLSS allows a flexible and dynamic adjustment of the HD tolerance threshold via several design variables. Experimental measurements demonstrate the efficiency of our sensing scheme in tolerating very large HDs with the highest sensitivity.
引用
收藏
页码:3867 / 3871
页数:5
相关论文
共 50 条
  • [31] Content-Addressable Memory System Using a Nanoelectromechanical Memory Switch
    Kim, Hyunju
    Cho, Mannhee
    Lee, Sanghyun
    Kwon, Hyug Su
    Choi, Woo Young
    Kim, Youngmin
    ELECTRONICS, 2022, 11 (03)
  • [32] Analog content-addressable memory from complementary FeFETs
    Liu, Xiwen
    Katti, Keshava
    He, Yunfei
    Jacob, Paul
    Richter, Claudia
    Schroeder, Uwe
    Kurinec, Santosh
    Chaudhari, Pratik
    Jariwala, Deep
    DEVICE, 2024, 2 (02):
  • [33] AN 8-KBIT CONTENT-ADDRESSABLE AND REENTRANT MEMORY
    KADOTA, H
    MIYAKE, J
    NISHIMICHI, Y
    KUDOH, H
    KAGAWA, K
    IEEE JOURNAL OF SOLID-STATE CIRCUITS, 1985, 20 (05) : 951 - 957
  • [34] CONTENT-ADDRESSABLE MEMORY - THE SOLUTION FINALLY FINDS A PROBLEM
    WILSON, R
    COMPUTER DESIGN, 1988, 27 (22): : 105 - 105
  • [35] WDM Ternary Content-addressable Memory for Optical Links
    London, Yanir
    Van Vaerenbergh, Thomas
    Ramini, Luca
    Li, Can
    Graves, Catherine E.
    Fiorentino, Marco
    Beausoleil, Raymond G.
    2023 IEEE SILICON PHOTONICS CONFERENCE, SIPHOTONICS, 2023,
  • [36] Multiple Cell Upsets Tolerant Content-Addressable Memory
    Abbas, Syed Mohsin
    Baeg, Sanghyeon
    Park, Sungju
    2011 IEEE INTERNATIONAL RELIABILITY PHYSICS SYMPOSIUM (IRPS), 2011,
  • [37] Sentence Comprehension Is Mediated by Content-Addressable Memory Structures
    Brian McElree
    Journal of Psycholinguistic Research, 2000, 29 : 111 - 123
  • [38] MINIMUM SPANNING TREE GENERATION WITH CONTENT-ADDRESSABLE MEMORY
    PARK, TG
    OLDFIELD, JV
    ELECTRONICS LETTERS, 1993, 29 (11) : 1037 - 1039
  • [39] Sentence comprehension is mediated by content-addressable memory structures
    McElree, B
    JOURNAL OF PSYCHOLINGUISTIC RESEARCH, 2000, 29 (02) : 111 - 123
  • [40] CONTENT-ADDRESSABLE AND ASSOCIATIVE MEMORY - ALTERNATIVES TO THE UBIQUITOUS RAM
    CHISVIN, L
    DUCKWORTH, RJ
    COMPUTER, 1989, 22 (07) : 51 - 63