Automatic generation of polynomial-based hardware architectures for function evaluation

Florent de Dinechin 1, 2 Mioara Joldes 1, 2 Bogdan Pasca 1, 2
1 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Many applications require the evaluation of some function through polynomial approximation. This article details an architecture generator for this class of problems that improves upon the literature in two aspects. Firstly, it benefits from recent advances related to constrained-coefficient polynomial approximation. Secondly, it refines the error analysis of polynomial evaluation to reduce the size of the multipliers used. As a result, architectures for evaluating arbitrary functions with precisions up to 64 bits, making efficient use of the resources of recent FPGAs, can be obtained in seconds. An open-source implementation is provided in the FloPoCo project.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00470506
Contributor : Florent de Dinechin <>
Submitted on : Tuesday, April 6, 2010 - 5:03:10 PM
Last modification on : Thursday, February 7, 2019 - 3:26:50 PM
Long-term archiving on : Friday, October 19, 2012 - 11:20:32 AM

File

RR-LIP-2010-14.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-00470506, version 1

Collections

Citation

Florent de Dinechin, Mioara Joldes, Bogdan Pasca. Automatic generation of polynomial-based hardware architectures for function evaluation. Application-specific Systems, Architectures and Processors, Jul 2010, Rennes, France. ⟨ensl-00470506⟩

Share

Metrics

Record views

364

Files downloads

505