Towards the Multiple Constant Multiplication at Minimal Hardware Cost

10/06/2022
by   Rémi Garcia, et al.
0

Multiple Constant Multiplication (MCM) over integers is a frequent operation arising in embedded systems that require highly optimized hardware. An efficient way is to replace costly generic multiplication by bit-shifts and additions, i.e. a multiplierless circuit. In this work, we improve the state-of-the-art optimal approach for MCM, based on Integer Linear Programming (ILP). We introduce a new lower-level hardware cost, based on counting the number of one-bit adders and demonstrate that it is strongly correlated with the LUT count. This new model for the multiplierless MCM circuits permitted us to consider intermediate truncations that permit to significantly save resources when a full output precision is not required. We incorporate the error propagation rules into our ILP model to guarantee a user-given error bound on the MCM results. The proposed ILP models for multiple flavors of MCM are implemented as an open-source tool and, combined with the FloPoCo code generator, provide a complete coefficient-to-VHDL flow. We evaluate our models in extensive experiments, and propose an in-depth analysis of the impact that design metrics have on actually synthesized hardware.

READ FULL TEXT
research
08/03/2021

Hardware-aware Design of Multiplierless Second-Order IIR Filters with Minimum Adders

In this work, we optimally solve the problem of multiplierless design of...
research
03/01/2023

BP-NTT: Fast and Compact in-SRAM Number Theoretic Transform with Bit-Parallel Modular Multiplication

Number Theoretic Transform (NTT) is an essential mathematical tool for c...
research
02/28/2019

Lower Bounds for Multiplication via Network Coding

Multiplication is one of the most fundamental computational problems, ye...
research
06/21/2018

Generic and Universal Parallel Matrix Summation with a Flexible Compression Goal for Xilinx FPGAs

Bit matrix compression is a highly relevant operation in computer arithm...
research
03/09/2021

Fast and Efficient Bit-Level Precision Tuning

In this article, we introduce a new technique for precision tuning. This...
research
06/26/2023

Integer Linear Programming Modeling of Addition Sequences With Additional Constraints for Evaluation of Power Terms

In this work, an integer linear programming (ILP) based model is propose...
research
02/05/2019

Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries

On common processors, integer multiplication is many times faster than i...

Please sign up or login with your details

Forgot password? Click here to reset