Building Reliable Arithmetic Multipliers Under NBTI Aging and Process Variations

• URL: http://arxiv.org/abs/2605.18444v1
• Date: Mon, 18 May 2026 14:12:01 GMT
• Title: Building Reliable Arithmetic Multipliers Under NBTI Aging and Process Variations
• Abstract summary: We focus on the aging of arithmetic multipliers, which are a cornerstone of modern computing systems.<n>In particular, AI workloads can accelerate Negative Bias Temperature Instability (NBTI) effects in multipliers.<n>This paper presents a novel aging mitigation technique that leverages the signinvariance property of multiplication.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hardware aging poses a significant challenge for integrated circuits (ICs), leading to performance degradation and eventual failure. In this work, we focus on the aging of arithmetic multipliers, which are a cornerstone of modern computing systems including in CPUs, GPUs, and FPGAs, as well as AI accelerators like systolic arrays. In particular, AI workloads, which rely predominantly on multiplications, can accelerate Negative Bias Temperature Instability (NBTI) effects in multipliers. This paper presents a novel aging mitigation technique that leverages the signinvariance property of multiplication. By selectively applying 2s complement transformations to inputs, the method redistributes stress across transistors, reducing the effects of NBTI aging. The proposed method is also integrated into systolic arrays, a common AI accelerator, to demonstrate its efficiency in a high-throughput AI accelerator. Experimental evaluations using Cadence tools show better lifetime compared to natural aging (with no mitigation) baseline, while introducing negligible area and delay overheads.

Related papers

• Attacking AI Accelerators by Leveraging Arithmetic Properties of Addition [0.0]
  We present a new hardware aging attack that exploits commutative properties of addition to disrupt the multiply-and-add operation.<n>By permuting the inputs of an adder, the attack preserves functional correctness while inducing unbalanced stress among transistors, accelerating delay degradation in the circuit.
  arXiv  Detail & Related papers  (2026-03-28T23:03:27Z)
• Neuro-Channel Networks: A Multiplication-Free Architecture by Biological Signal Transmission [0.0]
  The rapid proliferation of Deep Learning is constrained by its heavy reliance on high-performance hardware.<n>These specialized accelerators are not only prohibitively expensive and energy-intensive but also suffer from significant supply scarcity.<n>We propose Neuro-Channel Networks (NCN), a novel multiplication-free architecture designed to decouple AI from expensive hardware dependencies.
  arXiv  Detail & Related papers  (2026-01-05T16:33:13Z)
• Spark Transformer: Reactivating Sparsity in FFN and Attention [53.221448818147024]
  We introduce Spark Transformer, a novel architecture that achieves a high level of activation sparsity in both FFN and the attention mechanism.<n>This sparsity translates to a 2.5x reduction in FLOPs, leading to decoding wall-time speedups of up to 1.79x on CPU and 1.40x on GPU.
  arXiv  Detail & Related papers  (2025-06-07T03:51:13Z)
• A Smooth Transition Between Induction and Deduction: Fast Abductive Learning Based on Probabilistic Symbol Perception [81.30687085692576]
  We introduce an optimization algorithm named as Probabilistic Symbol Perception (PSP), which makes a smooth transition between induction and deduction.<n> Experiments demonstrate the promising results.
  arXiv  Detail & Related papers  (2025-02-18T14:59:54Z)
• Joint Transmit and Pinching Beamforming for Pinching Antenna Systems (PASS): Optimization-Based or Learning-Based? [89.05848771674773]
  A novel antenna system ()-enabled downlink multi-user multiple-input single-output (MISO) framework is proposed.<n>It consists of multiple waveguides, which equip numerous low-cost antennas, named (PAs)<n>The positions of PAs can be reconfigured to both spanning large-scale path and space.
  arXiv  Detail & Related papers  (2025-02-12T18:54:10Z)
• Algorithmic Strategies for Sustainable Reuse of Neural Network Accelerators with Permanent Faults [9.89051364546275]
  We propose novel approaches that quantify permanent hardware faults in neural network (NN) accelerators by uniquely integrating the behavior of the faulty component instead of bypassing it.<n>We propose several algorithmic mitigation techniques for a subset of stuck-at faults, such as Invertible Scaling or Shifting of activations and weights, or fine tuning with the faulty behavior.<n> Notably, the proposed techniques do not require any hardware modification, instead relying on existing components of widely used systolic array based accelerators.
  arXiv  Detail & Related papers  (2024-12-17T18:56:09Z)
• Accelerating AI Performance using Anderson Extrapolation on GPUs [2.114333871769023]
  We present a novel approach for accelerating AI performance by leveraging Anderson extrapolation.<n>By identifying the crossover point where a mixing penalty is incurred, the method focuses on reducing iterations to convergence.<n>We demonstrate significant improvements in both training and inference, motivated by scalability and efficiency extensions to the realm of high-performance computing.
  arXiv  Detail & Related papers  (2024-10-25T10:45:17Z)
• Dynamic Range Reduction via Branch-and-Bound [1.0141085397402314]
  Key strategy to enhance hardware accelerators is the reduction of precision in arithmetic operations.<n>This paper introduces a fully principled Branch-and-Bound algorithm for reducing precision needs in QUBO problems.<n> Experiments validate our algorithm's effectiveness on an actual quantum annealer.
  arXiv  Detail & Related papers  (2024-09-17T03:07:56Z)
• 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)
• HEAT: Hardware-Efficient Automatic Tensor Decomposition for Transformer Compression [69.36555801766762]
  We propose a hardware-aware tensor decomposition framework, dubbed HEAT, that enables efficient exploration of the exponential space of possible decompositions. We experimentally show that our hardware-aware factorized BERT variants reduce the energy-delay product by 5.7x with less than 1.1% accuracy loss.
  arXiv  Detail & Related papers  (2022-11-30T05:31:45Z)
• Efficient Few-Shot Object Detection via Knowledge Inheritance [62.36414544915032]
  Few-shot object detection (FSOD) aims at learning a generic detector that can adapt to unseen tasks with scarce training samples. We present an efficient pretrain-transfer framework (PTF) baseline with no computational increment. We also propose an adaptive length re-scaling (ALR) strategy to alleviate the vector length inconsistency between the predicted novel weights and the pretrained base weights.
  arXiv  Detail & Related papers  (2022-03-23T06:24:31Z)

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.