Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

When FPGAs are better at floating-point than microprocessors

Abstract : It has been shown that FPGAs could outperform high-end microprocessors on floating-point computations thanks to massive parallelism. However, most previous studies re-implement in the FPGA the operators present in a processor. This is a safe and relatively straightforward approach, but it doesn't exploit the greater flexibility of the FPGA. This article is a survey of the many ways in which the FPGA implementation of a given floating-point computation can be not only faster, but also more accurate than its microprocessor counterpart. Techniques studied here include custom precision, specific accumulator design, dedicated architectures for coarser operators which have to be implemented in software in processors, and others. A real-world biomedical application illustrates these claims. This study also points to how current FPGA fabrics could be enhanced for better floating-point support.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [40 references]  Display  Hide  Download
Contributor : Florent de Dinechin Connect in order to contact the contributor
Submitted on : Monday, September 24, 2007 - 4:39:22 PM
Last modification on : Thursday, September 29, 2022 - 2:58:07 PM
Long-term archiving on: : Monday, September 24, 2012 - 12:45:52 PM


Files produced by the author(s)


  • HAL Id : ensl-00174627, version 1



Florent de Dinechin, Jérémie Detrey, Octavian Creţ, Radu Tudoran. When FPGAs are better at floating-point than microprocessors. 2007. ⟨ensl-00174627⟩



Record views


Files downloads