A Logic-Reuse Approach to Nibble-based Multiplier Design for Low Power Vector Computing
Md Rownak Hossain Chowdhury, Mostafizur Rahman

TL;DR
This paper introduces a nibble-based multiplier architecture for low-power vector computing that uses precomputed reusable nibble values to achieve efficient, low-area, and low-power multiplication suitable for AI acceleration.
Contribution
It proposes a novel precompute-reuse nibble multiplier design that balances latency and complexity, reducing area and power compared to traditional array and shift-add multipliers.
Findings
Up to 1.69x area reduction in RTL implementations.
Up to 1.63x power improvement over shift-add multipliers.
Nearly 2.6x area and 2.7x power savings compared to LUT-based array multipliers.
Abstract
Vector multiplication is a fundamental operation for AI acceleration, responsible for over 85% of computational load in convolution tasks. While essential, these operations are primary drivers of area, power, and delay in modern datapath designs. Conventional multiplier architectures often force a compromise between latency and complexity: high-speed array multipliers demand significant power, whereas sequential designs offer efficiency at the cost of throughput. This paper presents a precompute-reuse nibble multiplier architecture that bridges this gap by reformulating multiplication as a structured composition of reusable nibble-level precomputed values. The proposed design treats each operand as an independent low-precision element, decomposes it into fixed-width nibbles, and generates scaled multiples of a broadcast operand using compact shift-add logic. By replacing wide lookup…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLow-power high-performance VLSI design · Numerical Methods and Algorithms · Cryptography and Residue Arithmetic
