Explicit Sign-Magnitude Encoders Enable Power-Efficient Multipliers
Not on the map. Why?
Abstract (arXiv)
This work presents a method to maximize power-efficiency of fixed point multiplier units by decomposing them into sub-components. First, an encoder block converts the operands from a two's complement to a sign magnitude representation, followed by a multiplier module which performs the compute operation and outputs the resulting value in the original format. This allows to leverage the power-efficiency of the Sign Magnitude encoding for the multiplication. To ensure the computing format is not altered, those two components are synthesized and optimized separately. Our method leads to significant power savings for input values centered around zero, as commonly encountered in AI workloads. Under a realistic input stream with values normally distributed with a standard deviation of 3.0, post-synthesis simulations of the 4-bit multiplier design show up to 12.9% lower switching activity compared to synthesis without decomposition. Those gains are achieved while ensuring compliance into any production-ready system as the overall circuit stays logic-equivalent. With the compliance lifted and a slightly smaller input range of -7 to +7, switching activity reductions can reach up to 33%. Additionally, we demonstrate that synthesis optimization methods based on switching-activity-driven design space exploration can yield a further 5-10% improvement in power-efficiency compared to a power agnostic approach.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 24 Jul 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2024RL-MUL 2.0: Multiplier Design Optimization with Parallel Deep Reinforcement Learning and Space Reduction
- 2025AC-Refiner: Efficient Arithmetic Circuit Optimization Using Conditional Diffusion Models
- 2026Shift-Accumulate Attention: Multiplier-Free Query--Key Products for Transformer Decoding ↗
- 2026Investigating Energy Bounds of Analog Compute-in-Memory with Local Normalization
- 2024Scalable and Effective Arithmetic Tree Generation for Adder and Multiplier Designs
- 2022A Soft SIMD Based Energy Efficient Computing Microarchitecture
- 2024Efficient transformer adaptation for analog in-memory computing via low-rank adapters
- 2025Low-Bit Integerization of Vision Transformers using Operand Reordering for Efficient Hardware