Hardware-Software Co-Design of Scalable, Energy-Efficient Analog Recurrent Computations

• URL: http://arxiv.org/abs/2605.15216v2
• Date: Mon, 18 May 2026 09:42:07 GMT
• Title: Hardware-Software Co-Design of Scalable, Energy-Efficient Analog Recurrent Computations
• Abstract summary: Always-on AI applications, from environmental sensors to biomedical implants, require ultra-low power consumption.<n> Analog circuits offer a path to sub-microwatt inference, yet existing analog implementations are limited to feedforward architectures.<n>We demonstrate that this barrier can be overcome through hardware-software co-design.
• Score: 1.1023117530294009
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Always-on AI applications, from environmental sensors to biomedical implants, require ultra-low power consumption. Analog circuits offer a path to sub-microwatt inference, yet existing analog implementations are limited to feedforward architectures: extending them to recurrent dynamics has been considered impractical due to noise accumulation through temporal feedback. We demonstrate that this barrier can be overcome through hardware-software co-design. Specifically, we identify that Bistable Memory Recurrent Units (BMRUs), a class of Recurrent Neural Networks (RNNs) with discrete-valued outputs and hysteretic dynamics, admit an ultra-low power current-mode analog implementation which we design from first principles. The resulting circuit establishes a one-to-one correspondence between each learned parameter and a circuit element. The discrete outputs suppress analog noise by at least 20-fold at each cell boundary, breaking the noise accumulation that prevents analog recurrence. We reformulate BMRUs for first-quadrant operation with fixed thresholds, enabling the direct correspondence while preserving expressivity and trainability. Transistor-level simulations in 180 nm Complementary Metal-Oxide-Semiconductor (CMOS) show near-perfect agreement between software predictions and circuit-level behavior, with the software model thereby serving as a high-fidelity simulator of the physical hardware at low computational cost. We leverage this fidelity to conduct large-scale noise immunity and power scaling analyses: the power cost of adding recurrence scales linearly with state dimension, while the feedforward layers dominating total power scale quadratically, meaning recurrence is added at linear marginal cost relative to the feedforward backbone. End-to-end keyword spotting achieves sub-microwatt inference at the RNN core.

Related papers

• Multi-layer MIMO Relay as Deep Physical Neural Networks: Power Amplifiers as Activation Functions [56.870614369768354]
  Wireless physical neural networks (WPNNs) embed neural computation directly into analog hardware.<n>We propose a deep WPNN in which nonlinear activations are realized by a multi-hop multiple-input multiple-output (MIMO) relay network.<n>We show that the proposed architecture enables accurate over-the-air inference for image classification.
  arXiv  Detail & Related papers  (2026-07-20T09:45:07Z)
• Machine Learning-Based Reconstruction for Resistive Silicon Sensors [53.365453214937496]
  We study machine-learning-based reconstruction and compression for resistive silicon sensors.<n>We use full-waveform information from correlated pads to regularise the reconstruction and extract spatial information.<n>We first introduce recurrent neural network models based on LSTM layers, which provide a proof-of-concept implementation for full-waveform reconstruction.
  arXiv  Detail & Related papers  (2026-07-13T14:03:26Z)
• Rethinking Neural Nonlinearity as Gating [0.7073210405344709]
  We show that standard activations are in fact instances of a single Threshold Gating primitive.<n>For softmax, we show that it admits an exact TG conversion via its equivalent per-element Sigmoid form.<n>We also propose a 'Minimal Branch Theorem' which relates the minimum number of required branches in our primitive to the trainability of general deep neural networks.
  arXiv  Detail & Related papers  (2026-07-03T09:38:16Z)
• Improving the Performance and Learning Stability of Parallelizable RNNs Designed for Ultra-Low Power Applications [1.226598527858578]
  Bistable Memory Recurrent Unit (BMRU) was introduced to enable hardware-software co-design of ultra-low power RNNs.<n>BMRU performance lags behind parallelizable RNNs on complex sequential tasks.<n>We propose a cumulative update formulation that restores flow while preserving persistent memory, creating skip-connections through time.
  arXiv  Detail & Related papers  (2026-05-12T09:39:33Z)
• Fully Analog Resonant Recurrent Neural Network via Metacircuit [4.719633931942162]
  We present a fully analog resonant recurrent neural network (R$2$NN) implemented via a metacircuit architecture composed of coupled electrical local resonators.<n>This work establishes a scalable, fully analog paradigm for intelligent temporal processing and paves the way for low-latency, resource-efficient physical neural hardware for edge intelligence.
  arXiv  Detail & Related papers  (2026-04-19T06:13:45Z)
• Physical Analog Kolmogorov-Arnold Networks based on Reconfigurable Nonlinear-Processing Units [0.0]
  Kolmogorov-Arnold Networks (KANs) shift neural computation from linear layers to learnable nonlinear edge functions.<n>Here we introduce a physical analog KAN architecture in which edge functions are realized in materia using reconfigurable nonlinear-processing units (RNPUs)<n>We establish a realistic system-level hardware implementation that enables compact KAN-style regression and classification with programmable nonlinear transformations.
  arXiv  Detail & Related papers  (2026-02-07T12:33:11Z)
• In-memory Training on Analog Devices with Limited Conductance States via Multi-tile Residual Learning [59.091567092071564]
  In-memory training typically requires at least 8-bit conductance states to match digital baselines.<n>Many promising memristive devices such as ReRAM offer only about 4-bit resolution due to fabrication constraints.<n>This paper proposes a emphresidual learning framework that sequentially learns on multiple crossbar tiles to compensate the residual errors.
  arXiv  Detail & Related papers  (2025-10-02T19:44:25Z)
• MINIMALIST: switched-capacitor circuits for efficient in-memory computation of gated recurrent units [0.4941855521192951]
  Recurrent neural networks (RNNs) have been a long-standing candidate for processing of temporal sequence data.<n>Recent advances in training paradigms have now inspired new generations of efficient RNNs.<n>We introduce a streamlined and hardware-compatible architecture based on minimal gated recurrent units (GRUs)
  arXiv  Detail & Related papers  (2025-05-13T14:13:41Z)
• Rapid yet accurate Tile-circuit and device modeling for Analog In-Memory Computing [4.566622328597218]
  We quantify the impact of low-level distortions and noise, and develop a mathematical model for Multiply-ACcum (MAC) operations mapped to analog tiles.<n>We show that hardware fine-tuning using simple Gaussian noise provides resilience against ADC quantization and PCM read noise effects, but is less effective against IR-drop.
  arXiv  Detail & Related papers  (2025-05-05T22:56:49Z)
• Resistive Memory-based Neural Differential Equation Solver for Score-based Diffusion Model [55.116403765330084]
  Current AIGC methods, such as score-based diffusion, are still deficient in terms of rapidity and efficiency. We propose a time-continuous and analog in-memory neural differential equation solver for score-based diffusion. We experimentally validate our solution with 180 nm resistive memory in-memory computing macros.
  arXiv  Detail & Related papers  (2024-04-08T16:34:35Z)
• Pretraining Graph Neural Networks for few-shot Analog Circuit Modeling and Design [68.1682448368636]
  We present a supervised pretraining approach to learn circuit representations that can be adapted to new unseen topologies or unseen prediction tasks. To cope with the variable topological structure of different circuits we describe each circuit as a graph and use graph neural networks (GNNs) to learn node embeddings. We show that pretraining GNNs on prediction of output node voltages can encourage learning representations that can be adapted to new unseen topologies or prediction of new circuit level properties.
  arXiv  Detail & Related papers  (2022-03-29T21:18:47Z)
• Training End-to-End Analog Neural Networks with Equilibrium Propagation [64.0476282000118]
  We introduce a principled method to train end-to-end analog neural networks by gradient descent. We show mathematically that a class of analog neural networks (called nonlinear resistive networks) are energy-based models. Our work can guide the development of a new generation of ultra-fast, compact and low-power neural networks supporting on-chip learning.
  arXiv  Detail & Related papers  (2020-06-02T23:38:35Z)
• One-step regression and classification with crosspoint resistive memory arrays [62.997667081978825]
  High speed, low energy computing machines are in demand to enable real-time artificial intelligence at the edge. One-step learning is supported by simulations of the prediction of the cost of a house in Boston and the training of a 2-layer neural network for MNIST digit recognition. Results are all obtained in one computational step, thanks to the physical, parallel, and analog computing within the crosspoint array.
  arXiv  Detail & Related papers  (2020-05-05T08:00:07Z)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.