Reconfigurable constant multipliers: hardware models, optimization algorithm and applications

Read full text Summarise with VIRAT
Authors: Bastien Barbe, Louis Ledoux, Anastasia Volkova, Florent Dupont de Dinechin
Cited by: 0
References: 35

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This paper introduces a novel algorithm for building run-time reconfigurable single constant multipliers based on addition/subtraction, fixed bit-shift, and multiplexing. An exhaustive exploration of a wide design space using a mix of constraint programming, depth-first search, and branch-and-prune techniques ensures that the architectures are optimal in terms of hardware cost within their model. In this work, detailed bit-level cost models, both for ASIC and for FPGA, are defined and validated against actual syntheses. Compared to the state of the art, the proposed approach enables much larger constant sets and also significantly improves the performance of the resulting architectures. An application to quantized neural network inference demonstrates a reduction in multiplier area with no degradation in delay or accuracy.

Fields of Study & Subjects

Embedded Systems Design Techniques VLSI and FPGA Design Techniques Low-power high-performance VLSI design

Publication details

Journal / source
Microprocessors and Microsystems
Volume
122
Pages
105270–105270
Publication date
26 March 2026
Language
EN