Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

In-Memory Nearest Neighbor Search with FeFET Multi-Bit Content-Addressable Memories (2011.07095v1)

Published 13 Nov 2020 in cs.ET and cs.LG

Abstract: Nearest neighbor (NN) search is an essential operation in many applications, such as one/few-shot learning and image classification. As such, fast and low-energy hardware support for accurate NN search is highly desirable. Ternary content-addressable memories (TCAMs) have been proposed to accelerate NN search for few-shot learning tasks by implementing $L_\infty$ and Hamming distance metrics, but they cannot achieve software-comparable accuracies. This paper proposes a novel distance function that can be natively evaluated with multi-bit content-addressable memories (MCAMs) based on ferroelectric FETs (FeFETs) to perform a single-step, in-memory NN search. Moreover, this approach achieves accuracies comparable to floating-point precision implementations in software for NN classification and one/few-shot learning tasks. As an example, the proposed method achieves a 98.34% accuracy for a 5-way, 5-shot classification task for the Omniglot dataset (only 0.8% lower than software-based implementations) with a 3-bit MCAM. This represents a 13% accuracy improvement over state-of-the-art TCAM-based implementations at iso-energy and iso-delay. The presented distance function is resilient to the effects of FeFET device-to-device variations. Furthermore, this work experimentally demonstrates a 2-bit implementation of FeFET MCAM using AND arrays from GLOBALFOUNDRIES to further validate proof of concept.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (9)
  1. Arman Kazemi (10 papers)
  2. Mohammad Mehdi Sharifi (4 papers)
  3. Ann Franchesca Laguna (6 papers)
  4. Ramin Rajaei (3 papers)
  5. Ricardo Olivo (2 papers)
  6. Michael Niemier (23 papers)
  7. X. Sharon Hu (22 papers)
  8. Franz Müller (8 papers)
  9. Thomas Kämpfe (20 papers)
Citations (36)

Summary

We haven't generated a summary for this paper yet.