Exploring Hyperdimensional Associative Memory
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Brain-inspired hyperdimensional (HD) computing emulates cognition tasks by computing with hypervectors as an alternative to computing with numbers. At its very core, HD computing is about manipulating and comparing large patterns, stored in memory as hypervectors: the input symbols are mapped to a hypervector and an associative search is performed for reasoning and classification. For every classification event, an associative memory is in charge of finding the closest match between a set of learned hypervectors and a query hypervector by using a distance metric. Hypervectors with the i.i.d. components qualify a memory-centric architecture to tolerate massive number of errors, hence it eases cooperation of various methodological design approaches for boosting energy efficiency and scalability. This paper proposes architectural designs for hyperdimensional associative memory (HAM) to facilitate energy-efficient, fast, and scalable search operation using three widely-used design approaches. These HAM designs search for the nearest Hamming distance, and linearly scale with the number of dimensions in the hypervectors while exploring a large design space with orders of magnitude higher efficiency. First, we propose a digital CMOS-based HAM (D-HAM) that modularly scales to any dimension. Second, we propose a resistive HAM (R-HAM) that exploits timing discharge characteristic of nonvolatile resistive elements to approximately compute Hamming distances at a lower cost. Finally, we combine such resistive characteristic with a currentbased search method to design an analog HAM (A-HAM) that results in faster and denser alternative. Our experimental results show that R-HAM and A-HAM improve the energy-delay product by 9.6× and 1347× compared to D-HAM while maintaining a moderate accuracy of 94% in language recognition.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Landauer, T. K., & Dumais, S. T. (1997) · Psychological Review · doi:10.1037/0033-295x.104.2.211 · Cited by 6,282
Memristive devices for computing
Yang, J. J., Strukov, D. B., & Stewart, D. R. (2013) · Nature Nanotechnology · doi:10.1038/nnano.2012.240 · Cited by 3,885 · cited 1×
“For the memristive crossbar, we use devices with large OFF/ON resistance ratio to design the stable CAM with large sense margin [28].”
MethodMemristive switching mechanism for metal/oxide/metal nanodevices
Yang, J. J., Pickett, M. D., Li, X., Ohlberg, D. A. A., Stewart, D. R., & Williams, R. S. (2008) · Nature Nanotechnology · doi:10.1038/nnano.2008.160 · Cited by 2,987 · cited 1×
“, Pt) sandwich an oxide layer based on Ta, Ti and HF [20], [21], [22].”
BackgroundKim, K.-H., Gaba, S., Wheeler, D., Cruz-Albrecht, J. M., Hussain, T., Srinivasa, N., & Lu, W. (2012) · Nano Letters · doi:10.1021/nl203687n · Cited by 924 · cited 1×
“To further alleviate the current saturation issue, we use memristor devices with reported large ON resistance [23] that provide stable ML voltage for the better distinction between the distances at a cost to slower search operation.”
MethodA Robust and Energy-Efficient Classifier Using Brain-Inspired Hyperdimensional Computing
Rahimi, A., Kanerva, P., & Rabaey, J. M. (2016) · Proceedings of the 2016 International Symposium on Low Power Electronics and Design · doi:10.1145/2934583.2934624 · Cited by 276 · cited 7×
“We accordingly design an architecture for recognizing a text’s language by generating and comparing text hypervectors [4], [5]: the text hypervector of an unknown text sample is compared for similarity to precomputed text hypervectors of known language samples – the former is referred to as a query hypervector, while…”
BackgroundMethodSelf-citation
Cited by
Ferroelectric ternary content-addressable memory for one-shot learning
Ni, K., Yin, X., Laguna, A. F., Joshi, S., Dünkel, S., Trentzsch, M., Müller, J., Beyer, S., Niemier, M., Hu, X. S., et al. (2019) · Nature Electronics · doi:10.1038/s41928-019-0321-3 · Cited by 382
SearcHD: A Memory-Centric Hyperdimensional Computing With Stochastic Training
Imani, M., Yin, X., Messerly, J., Gupta, S., Niemier, M., Hu, X. S., & Rosing, T. (2020) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2019.2952544 · Cited by 87
Self-citationHyper-Dimensional Computing Challenges and Opportunities for AI Applications
Hassan, E., Halawani, Y., Mohammad, B., & Saleh, H. (2022) · IEEE Access · doi:10.1109/access.2021.3059762 · Cited by 61
Metadata
- Authors
- Imani, M., Rahimi, A., Kong, D., Rosing, T., & Rabaey, J. M.
- Venue
- 2017 IEEE International Symposium on High Performance Computer Architecture (HPCA)
- Publisher
- IEEE
- Published
- 2017-02
- Pages
- 445-456
- ISSN
- 1530-0897 (ISSN-L)
- OpenAlex
- W2613567208
- Cited by
- 207
- References
- 5
- FWCI
- 31.13
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Exploring Hyperdimensional Associative Memory. https://app.cochat.ai/papers/10.1109/hpca.2017.28
- The paper
- Imani, M., Rahimi, A., Kong, D., Rosing, T., & Rabaey, J. M. (2017). Exploring Hyperdimensional Associative Memory. 2017 IEEE International Symposium on High Performance Computer Architecture (HPCA). https://doi.org/10.1109/hpca.2017.28
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.