Hamming Distance Tolerant Content-Addressable Memory (HD-CAM) for Approximate Matching Applications
Esteban Garz\'on, Roman Golman, Zuher Jahshan, Robert Hanhan, Natan, Vinshtok-Melnik, Marco Lanuzza, Adam Teman, Leonid Yavits

TL;DR
HD-CAM is a new energy-efficient content-addressable memory that uses charge redistribution for approximate matching, suitable for genomic applications like virus detection, and robust against process variations.
Contribution
It introduces a novel Hamming distance tolerant CAM design that improves energy efficiency and robustness for approximate search applications.
Findings
Supports wide range of mismatch thresholds
Operates reliably under process variations
Suitable for genomic surveillance applications
Abstract
We propose a novel Hamming distance tolerant content-addressable memory (HD-CAM) for energy-efficient in memory approximate matching applications. HD-CAM implements approximate search using matchline charge redistribution rather than its rise or fall time, frequently employed in state of-the-art solutions. HD-CAM was designed in a 65 nm 1.2 V CMOS technology and evaluated through extensive Monte Carlo simulations. Our analysis shows that HD-CAM supports robust operation under significant process variations and changes in the design parameters, enabling a wide range of mismatch threshold (tolerable Hamming distance) levels and pattern lengths. HD-CAM was functionally evaluated for virus DNA classification, which makes HD-CAM suitable for hardware acceleration of genomic surveillance of viral outbreaks such as Covid-19 pandemics.
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.
Taxonomy
TopicsNetwork Packet Processing and Optimization · Caching and Content Delivery · Covalent Organic Framework Applications
