Table-Based versus Shift-And-Add constant multipliers for FPGAs - Archive ouverte HAL Access content directly
Conference Papers Year :

Table-Based versus Shift-And-Add constant multipliers for FPGAs

(1) , (2) , (1) , (3)
1
2
3

Abstract

The multiplication by a constant is a frequently used operation. To implement it on Field Programmable Gate Arrays (FPGAs), the state of the art offers two completely different methods: one relying on bit shifts and additions/subtractions, and another one using look-up tables and additions. So far, it was unclear which method performs best for a given constant and input/output data types. The main contribution of this work is a thorough comparison of both methods in the main application contexts of constant multiplication: filters, signalprocessing transforms, and elementary functions. Most of the previous state of the art addresses multiplication by an integer constant. This work shows that, in most of these application contexts, a formulation of the problem as the multiplication by a real constant allows for more efficient architectures. Another contribution is a novel extension of the shift-and-add method to real constants. For that, an integer linear programming (ILP) formulation is proposed, which truncates each component in the shift-and-add network to a minimum necessary word size that is aligned with the approximation error of the coefficient. All methods are implemented within the open-source FloPoCo framework.
Fichier principal
Vignette du fichier
2019-TruncatedCM.pdf (346.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02147078 , version 1 (04-06-2019)

Identifiers

  • HAL Id : hal-02147078 , version 1

Cite

Florent de Dinechin, Silviu-Ioan Filip, Luc Forget, Martin Kumm. Table-Based versus Shift-And-Add constant multipliers for FPGAs. ARITH 2019 - 26th IEEE Symposium on Computer Arithmetic, Jun 2019, Kyoto, Japan. pp.1-8. ⟨hal-02147078⟩
130 View
1283 Download

Share

Gmail Facebook Twitter LinkedIn More