Skip to Main content Skip to Navigation
New interface

Synthesis of certified programs in fixed-point arithmetic, and its application to linear algebra basic blocks

Mohamed Amine Najahi 1 
1 DALI - Digits, Architectures et Logiciels Informatiques
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, UPVD - Université de Perpignan Via Domitia
Abstract : To be cost effective, embedded systems are shipped with low-end micro-processors. These processors are dedicated to one or few tasks that are highly demanding on computational resources. Examples of widely deployed tasks include the fast Fourier transform, convolutions, and digital filters. For these tasks to run efficiently, embedded systems programmers favor fixed-point arithmetic over the standardized and costly floating-point arithmetic. However, they are faced with two difficulties: First, writing fixed-point codes is tedious and requires that the programmer must be in charge of every arithmetical detail. Second, because of the low dynamic range of fixed-point numbers compared to floating-point numbers, there is a persistent belief that fixed-point computations are inherently inaccurate. The first part of this thesis addresses these two limitations as follows: It shows how to design and implement tools to automatically synthesize fixed-point programs. Next, to strengthen the user's confidence in the synthesized codes, analytic methods are suggested to generate certificates. These certificates can be checked using a formal verification tool, and assert that the rounding errors of the generated codes are indeed below a given threshold. The second part of the thesis is a study of the trade-offs involved when generating fixed-point code for linear algebra basic blocks. It gives experimental data on fixed-point synthesis for matrix multiplication and matrix inversion through Cholesky decomposition.
Document type :
Complete list of metadata

Cited literature [70 references]  Display  Hide  Download
Contributor : Mohamed Amine Najahi Connect in order to contact the contributor
Submitted on : Sunday, May 31, 2015 - 2:23:00 PM
Last modification on : Tuesday, September 6, 2022 - 4:53:36 PM
Long-term archiving on: : Monday, April 24, 2017 - 7:39:26 PM


  • HAL Id : tel-01158310, version 1



Mohamed Amine Najahi. Synthesis of certified programs in fixed-point arithmetic, and its application to linear algebra basic blocks. Computer Science [cs]. Université de Perpignan Via Domitia, 2014. English. ⟨NNT : ⟩. ⟨tel-01158310⟩



Record views


Files downloads