Reliable fixed-point implementation of linear data-flows

Abstract : In this article, we propose a complete methodology to implement a signal processing or control algorithm described with a linear data-flow into numerical code using fixed-point arithmetic. Our approach is based on a reliable determination of the Worst-Case Peak gain of a filter as well as on rigorous error analysis of roundoff error propagation. It guarantees that no overflow will occur and that the output error due to the finite precision implementation is less than a given bound. Without loss of generality, we consider the linear data-flows given in the form of Simulink block diagram. It is first transposed into an internal matrix-based representation and then the reliable evaluation of the magnitudes of each internal variable is performed. Our approach allows to determine the minimum word-length required to achieve a given accuracy. Finally, the methodology is illustrated with numerical examples.
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01347637
Contributor : Anastasia Volkova <>
Submitted on : Wednesday, September 7, 2016 - 1:37:08 PM
Last modification on : Thursday, March 21, 2019 - 2:22:15 PM

File

PID4431497.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01347637, version 2

Citation

Thibault Hilaire, Anastasia Volkova, Maminionja Ravoson. Reliable fixed-point implementation of linear data-flows. IEEE International Workshop on Signal Processing Systems (SiPS), Oct 2016, Dallas, United States. ⟨hal-01347637v2⟩

Share

Metrics

Record views

536

Files downloads

276