Skip to Main content Skip to Navigation
Master Thesis

Scalable Analytical Accuracy Models for Fixed-Point Arithmetic Implementations

Abstract : Signal processing algorithms for embedded systems are usually designed and specified with floating-point datatypes, but many embedded architectures do not even feature floating-point operators. Before being implemented in hardware, the algorithm must hence undergo a conversion to fixed-point arithmetic. This conversion is a tedious process and can cause a degradation in the accuracy of the algorithm. This degradation must be evaluated in order to guarantee the proper functioning of the system. Also, a typical requirement is to minimize the cost of the system as long as the accuracy criterion is satisfied. It is called wordlength optimization. Until recently, the only methods available for accuracy evaluation were based on bitaccurate simulations. Simulation times prohibited the use of automatic optimization algorithms. During the last decade, new analytical methods have emerged. These methods still face severe scaling limitations and cannot handle parametric programs. In this work, we study the relevance of the polyhedral model and of polyhedral intermediate representations for the development of a new analytical technique for accuracy estimation. We show that the formalism of Systems of Affine Recurrence Equations (SAREs) can be used to perform noise analysis. We derive a method and a set of program transformations that allow us to handle some classes of programs, and even some recursive filters.
Complete list of metadata
Contributor : Co-Responsables Du Mri V. Gouranton Et S. Blazy <>
Submitted on : Wednesday, August 28, 2013 - 2:14:20 PM
Last modification on : Tuesday, June 15, 2021 - 4:16:45 PM
Long-term archiving on: : Thursday, April 6, 2017 - 9:45:46 AM


  • HAL Id : dumas-00854960, version 1


Gaël Deest. Scalable Analytical Accuracy Models for Fixed-Point Arithmetic Implementations. Embedded Systems. 2013. ⟨dumas-00854960⟩



Record views


Files downloads