Related Experiment Video
Updated: Jul 9, 2025

05:19
Using Neuron Spiking Activity to Trigger Closed-Loop Stimuli in Neurophysiological Experiments
Published on: November 12, 2019
7.1K
A Low-Latency DNN Accelerator Enabled by DFT-Based Convolution Execution Within Crossbar Arrays.
IEEE Transactions on Neural Networks and Learning Systems
|November 29, 2023
Summary
This study introduces a novel discrete Fourier transform (DFT)-based method for analog resistive random-access memory (RRAM) to accelerate neural network training and inference. This approach significantly reduces latency and power consumption in hardware accelerators.
Area of Science:
- Materials Science
- Computer Engineering
- Artificial Intelligence
Background:
- Analog resistive random-access memory (RRAM) enables efficient in-memory computing for neural networks, overcoming von Neumann architecture limitations.
- However, the high tuning time for RRAM conductance states introduces latency in real-time training.
- Existing methods face challenges in balancing performance, power, and memory endurance.
Purpose of the Study:
- To develop a discrete Fourier transform (DFT)-based in-memory convolution methodology for analog RRAM.
- To reduce system latency and input regeneration in neural network accelerators.
- To minimize RRAM conductance updates, thereby enhancing training speed and device endurance.
Main Methods:
- Storing static DFT/inverse DFT (IDFT) coefficients within analog RRAM arrays.
- Performing convolution in the Fourier domain to minimize digital computations.
- Leveraging DFT/IDFT properties like symmetry and linearity for optimization.
Main Results:
- Significantly accelerated neural network training and inference by minimizing connection weight updates.
- Reduced power consumption for convolution operations compared to conventional methods.
- Enhanced peak power efficiency and area efficiency in the designed hardware accelerator.
Conclusions:
- The developed DFT-based RRAM methodology offers a pathway to ultrafast, low-power, and compact hardware accelerators.
- Minimizing RRAM conductance update frequency mitigates endurance limitations.
- This approach enables efficient edge deployment of deep neural networks with reduced latency and energy consumption.
Related Concept Videos
Fast Fourier Transform
340
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
340
Discrete Fourier Transform
295
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
295
Convolution: Math, Graphics, and Discrete Signals
264
In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
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...
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...
264
Linear Approximation in Frequency Domain
92
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
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....
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....
92
Linear Approximation in Time Domain
83
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
83
Properties of DTFT II
202
In the study of discrete-time signal processing, understanding the properties of the Discrete-Time Fourier Transform (DTFT) is crucial for analyzing and manipulating signals in the frequency domain. Several properties, including frequency differentiation, convolution, accumulation, and Parseval's relation, offer powerful tools for signal analysis.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω.
202

