Related Experiment Video
Updated: Jul 9, 2025

Using Neuron Spiking Activity to Trigger Closed-Loop Stimuli in Neurophysiological Experiments
Published on: November 12, 2019
A Low-Latency DNN Accelerator Enabled by DFT-Based Convolution Execution Within Crossbar Arrays
Abstract:
Analog resistive random access memory (RRAM) devices enable parallelized nonvolatile in-memory vector-matrix multiplications for neural networks eliminating the bottlenecks posed by von Neumann architecture. While using RRAMs improves the accelerator performance and enables their deployment at the edge, the high tuning time needed to update the RRAM conductance states adds significant burden and latency to real-time system training. In this article, we develop an in-memory discrete Fourier transform (DFT)-based convolution methodology to reduce system latency and input regeneration. By storing the static DFT/inverse DFT (IDFT) coefficients within the analog arrays, we keep digital computational operations using digital circuits to a minimum. By performing the convolution in reciprocal Fourier space, our approach minimizes connection weight updates, which significantly accelerates both neural network training and interference. Moreover, by minimizing RRAM conductance update frequency, we mitigate the endurance limitations of resistive nonvolatile memories. We show that by leveraging the symmetry and linearity of DFT/IDFTs, we can reduce the power by for convolution over conventional execution. The designed hardware-aware deep neural network (DNN) inference accelerator enhances the peak power efficiency by and area efficiency by over state-of-the-art accelerators. This article paves the way for ultrafast, low-power, compact hardware accelerators.
Related Concept Videos
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Discrete Fourier Transform
Convolution: Math, Graphics, and Discrete Signals
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Properties of DTFT II
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω.

