In-Memory Nearest Neighbor Search with FeFET Multi-Bit Content-Addressable Memories
Arman Kazemi, Mohammad Mehdi Sharifi, Ann Franchesca Laguna, Franz, M\"uller, Ramin Rajaei, Ricardo Olivo, Thomas K\"ampfe, Michael Niemier, X., Sharon Hu

TL;DR
This paper introduces a novel FeFET-based multi-bit content-addressable memory for in-memory nearest neighbor search, achieving software-comparable accuracy and improved performance over existing TCAM-based methods in low-energy hardware implementations.
Contribution
It proposes a new distance function compatible with FeFET MCAMs, enabling accurate, single-step in-memory NN search with resilience to device variations, and demonstrates a 2-bit FeFET MCAM prototype.
Findings
Achieves 98.34% accuracy on Omniglot 5-way 5-shot classification
Outperforms state-of-the-art TCAM-based NN search by 13% in accuracy at similar energy and delay
Demonstrates a 2-bit FeFET MCAM prototype with experimental validation
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 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
