NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Associative memories using complex-valued Hopfield networks based on spin-torque oscillator arrays
Published
Author(s)
Nitin Prasad, Prashansa Mukim, Advait Madhavan, Mark Stiles
Abstract
Simulations of complex valued Hopfield networks based on spin-torque oscillators can recover phase-encoded images. Sequences of memristor-augmented inverters provide tunable delay elements that implement complex weights by phase shifting the oscillatory output of the oscillators. Pseudo-inverse training is sufficient to store at least twelve images in a set of 192 oscillators, representing the $16\times 12$ pixel images. The energy to recover an image depends on the desired error level. For the oscillators and circuitry considered here, 1\% root mean square deviations from the ideal image require approximately 5$\mu$s and consumes roughly 465nJ. Simulations show that the network functions well when the resonant frequency of the oscillators has a fractional spread less than $10^-3}$ depending on the strength of the feedback.
Prasad, N.
, Mukim, P.
, Madhavan, A.
and Stiles, M.
(2022),
Associative memories using complex-valued Hopfield networks based on spin-torque oscillator arrays, Neuromorphic Computing and Engineering, [online], https://doi.org/10.1088/2634-4386/ac7d05, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=933660
(Accessed October 8, 2025)