A Correctly-Rounded Fixed-Point-Arithmetic Dot-Product Algorithm - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

A Correctly-Rounded Fixed-Point-Arithmetic Dot-Product Algorithm


Dot products (also called sums of products) are ubiquitous in matrix computations, for instance in signal processing. We are especially interested in digital filters, where they are the core operation. We therefore focus on fixed-point arithmetic, used in embedded systems for time and energy efficiency. Common dot product algorithms ensure faithful rounding. For the sake of accuracy and reproducibility, we want to ensure correct rounding. This article describes an algorithm that computes a correctly-rounded sum of products from inputs whose format is known in advance. This algorithm relies on odd rounding (that is easily implemented in hardware) and comes with a careful proof and some cost analysis.
Fichier principal
Vignette du fichier
paper_17.pdf (277.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02982017 , version 1 (28-10-2020)



Sylvie Boldo, Diane Gallois-Wong, Thibault Hilaire. A Correctly-Rounded Fixed-Point-Arithmetic Dot-Product Algorithm. ARITH 2020 - IEEE 27th Symposium on Computer Arithmetic, Jun 2020, Portland, United States. pp.9-16, ⟨10.1109/ARITH48897.2020.00011⟩. ⟨hal-02982017⟩
130 View
603 Download



Gmail Facebook X LinkedIn More