A new scheme for table-based evaluation of functions (2008)
Defour, David, Dupont De Dinechin, Florent, Muller, Jean-Michel
This paper presents a new scheme for the hardware evaluation of functions in fixed-point format, for precisions up to 30 bits. This scheme yields an architecture made of four look-up tables, a...
A new scheme for table-based evaluation of functions (2008)
Defour, David, Dupont De Dinechin, Florent, Muller, Jean-Michel
This paper presents a new scheme for the hardware evaluation of functions in fixed-point format, for precisions up to 30 bits. This scheme yields an architecture made of four look-up tables, a...
Dupont De Dinechin, Florent, Defour, David, Lauter, Christoph
This article shows that IEEE-754 double-precision correct rounding of the most common elementary functions (exp/log, trigonometric and hyperbolic) is achievable on current processors using only...
Dupont De Dinechin, Florent, Defour, David, Lauter, Christoph
This article shows that IEEE-754 double-precision correct rounding of the most common elementary functions (exp/log, trigonometric and hyperbolic) is achievable on current processors using only...
Correctly Rounded Exponential Function in Double Precision Arithmetic (2008)
Defour, David, Dupont De Dinechin, Florent, Muller, Jean-Michel
We present an algorithm for implementing correctly rounded exponentials in double-precision floating point arithmetic. This algorithm is based on floating-point operations in the widespread IEEE-754...
Correctly Rounded Exponential Function in Double Precision Arithmetic (2008)
Defour, David, Dupont De Dinechin, Florent, Muller, Jean-Michel
We present an algorithm for implementing correctly rounded exponentials in double-precision floating point arithmetic. This algorithm is based on floating-point operations in the widespread IEEE-754...
Towards the post-ultimate libm (2008)
Dupont De Dinechin, Florent, Gast, Nicolas
This article presents advances in the subject of double-precision correctly rounded elementary functions since the publication of the libultim mathematical library developed by Ziv at IBM. This...
Some Improvements on Multipartite Table Methods (2008)
Dupont De Dinechin, Florent, Tisserand, Arnaud
This paper presents an unified view of most previous table-lookup-and-addition methods: bipartite tables, SBTM, STAM and multipartite method. This new definition allows a more accurate computation of...
Towards Portable Hierarchical Placement for FPGAs (2008)
Dupont De Dinechin, Florent, Luk, Wayne, Mckeever, Steve
Field Programmable Gate Arrays (FPGAs) are usually programmed using languages and methods inherited from the domain of VLSI synthesis. These methods, however, have not always been adapted to the new...
Fast and correctly rounded logarithms in double precision (2007)
Muller, Jean-Michel, Dupont De Dinechin, Florent, Lauter, Christoph
This article is a case study in the implementation of a portable, proven and efficient correctly rounded elementary function in double-precision. We describe the methodology used to achieve these...
Fast and correctly rounded logarithms in double precision (2007)
Muller, Jean-Michel, Dupont De Dinechin, Florent, Lauter, Christoph
This article is a case study in the implementation of a portable, proven and efficient correctly rounded elementary function in double-precision. We describe the methodology used to achieve these...
Structured Scheduling of Recurrence Equations (2006)
Risset, Tanguy, Dupont De Dinechin, Florent, Robert, Sophie
We study scheduling of structured systems of recurrence equations. We first recall the formalism of structured systems of recurrence equations, then we explain how to implement a scheduling tool for...
Structured Scheduling of Recurrence Equations (2006)
Risset, Tanguy, Dupont De Dinechin, Florent, Robert, Sophie
We study scheduling of structured systems of recurrence equations. We first recall the formalism of structured systems of recurrence equations, then we explain how to implement a scheduling tool for...
The Price of Routing in FPGAs (2006)
Among integrated circuits, field programmable gate arrays (FPGAs) may be the most spectacular benefactors of the steady progress of very large scale integration (VLSI) technology in the last two...
Towards the post-ultimate libm (2006)
Dupont De Dinechin, Florent, Gast, Nicolas
This article presents advances in the subject of double-precision correctly rounded elementary functions since the publication of the libultim mathematical library developed by Ziv at IBM. This...
Some Improvements on Multipartite Table Methods (2006)
Dupont De Dinechin, Florent, Tisserand, Arnaud
This paper presents an unified view of most previous table-lookup-and-addition methods: bipartite tables, SBTM, STAM and multipartite method. This new definition allows a more accurate computation of...
Towards Portable Hierarchical Placement for FPGAs (2006)
Dupont De Dinechin, Florent, Luk, Wayne, Mckeever, Steve
Field Programmable Gate Arrays (FPGAs) are usually programmed using languages and methods inherited from the domain of VLSI synthesis. These methods, however, have not always been adapted to the new...
The Price of Routing in FPGAs (2006)
Among integrated circuits, field programmable gate arrays (FPGAs) may be the most spectacular benefactors of the steady progress of very large scale integration (VLSI) technology in the last two...
Fast and correctly rounded logarithms in double precision (2006)
Muller, Jean-Michel, Dupont De Dinechin, Florent, Lauter, Christoph
This article is a case study in the implementation of a portable, proven and efficient correctly rounded elementary function in double-precision. We describe the methodology used to achieve these...
Fast and correctly rounded logarithms in double precision (2005)
Muller, Jean-Michel, Dupont De Dinechin, Florent, Lauter, Christoph
This article is a case study in the implementation of a portable, proven and efficient correctly rounded elementary function in double-precision. We describe the methodology used to achieve these...
Towards the post-ultimate libm (2004)
Dupont De Dinechin, Florent, Gast, Nicolas
This article presents advances in the subject of double-precision correctly rounded elementary functions since the publication of the libultim mathematical library developed by Ziv at IBM. This...
Dupont De Dinechin, Florent, Defour, David, Lauter, Christoph
This article shows that IEEE-754 double-precision correct rounding of the most common elementary functions (exp/log, trigonometric and hyperbolic) is achievable on current processors using only...
A new scheme for table-based evaluation of functions (2002)
Defour, David, Dupont De Dinechin, Florent, Muller, Jean-Michel
This paper presents a new scheme for the hardware evaluation of functions in fixed-point format, for precisions up to 30 bits. This scheme yields an architecture made of four look-up tables, a...
Correctly Rounded Exponential Function in Double Precision Arithmetic (2001)
Defour, David, Dupont De Dinechin, Florent, Muller, Jean-Michel
We present an algorithm for implementing correctly rounded exponentials in double-precision floating point arithmetic. This algorithm is based on floating-point operations in the widespread IEEE-754...
Some Improvements on Multipartite Table Methods (2000)
Dupont De Dinechin, Florent, Tisserand, Arnaud
This paper presents an unified view of most previous table-lookup-and-addition methods: bipartite tables, SBTM, STAM and multipartite method. This new definition allows a more accurate computation of...
Towards Portable Hierarchical Placement for FPGAs (1999)
Dupont De Dinechin, Florent, Luk, Wayne, Mckeever, Steve
Field Programmable Gate Arrays (FPGAs) are usually programmed using languages and methods inherited from the domain of VLSI synthesis. These methods, however, have not always been adapted to the new...
The Price of Routing in FPGAs (1999)
Among integrated circuits, field programmable gate arrays (FPGAs) may be the most spectacular benefactors of the steady progress of very large scale integration (VLSI) technology in the last two...
Structured Scheduling of Recurrence Equations (1997)
Risset, Tanguy, Dupont De Dinechin, Florent, Robert, Sophie
We study scheduling of structured systems of recurrence equations. We first recall the formalism of structured systems of recurrence equations, then we explain how to implement a scheduling tool for...