Floating-point error mitigation

Publications associées (22)

À propos
Confidentialité
Mentions légales

Graph Chatbot

A Householder-Based Algorithm For Hessenberg-Triangular Reduction

Daniel Kressner, Zvonimir Bujanovic

The QZ algorithm for computing eigenvalues and eigenvectors of a matrix pencil A - lambda B requires that the matrices first be reduced to Hessenberg-triangular (HT) form. The current method of choice for HT reduction relies entirely on Givens rotations re ...

SIAM PUBLICATIONS2018

Towards a Compiler for Reals

Viktor Kuncak, Eva Darulova

Numerical software, common in scientific computing or embedded systems, inevitably uses a finite-precision approximation of the real arithmetic in which most algorithms are designed. In many applications, the roundoff errors introduced by finite-precision ...

2017

A Low-power Carry Cut-Back Approximate Adder with Fixed-point Implementation and Floating-point Precision

Christian Enz, Vincent Frédéric Camus, Jérémy Lucien Maurice Schlachter

This paper introduces an approximate adder architecture based on a digital quasi-feedback technique called Carry Cut-Back in which high-significance stages can cut the carry propagation chain at lower-significance positions. This lightweight approach preve ...

Ieee2016

A Bio-Inspired Reconfigurable Architecture for Local Binary Descriptors

Selman Ergünay, Yusuf Leblebici

Limited resources of embedded devices and increased real time constraints have raised interest to the binary description methods over the floating-point ones such as SIFT and SURF in computer vision applications. Although many software applications of the ...

Ieee2016

JPEG XT: A Compression Standard for HDR and WCG Images [Standards in a Nutshell]

Touradj Ebrahimi, Philippe Hanhart

High bit depth data acquisition and manipulation have been largely studied at the academic level over the last 15 years and are rapidly attracting interest at the industrial level. An example of the increasing interest for high-dynamic range (HDR) imaging ...

Institute of Electrical and Electronics Engineers2016

Programming with Numerical Uncertainties

Eva Darulova

Numerical software, common in scientific computing or embedded systems, inevitably uses an approximation of the real arithmetic in which most algorithms are designed. In many domains, roundoff errors are not the only source of inaccuracy and measurement as ...

EPFL2014

Fast Directional Spatially Localized Spherical Harmonic Transform

Yves Wiaux, Jason Douglas McEwen

We propose a transform for signals defined on the sphere that reveals their localized directional content in the spatio-spectral domain when used in conjunction with an asymmetric window function. We call this transform the directional spatially localized ...

Institute of Electrical and Electronics Engineers2013

Synthesis of Fixed-Point Programs

Viktor Kuncak, Eva Darulova, Indranil Saha

Several problems in the implementations of control systems, signal-processing systems, and scientific computing systems reduce to compiling a polynomial expression over the reals into an imperative program using fixed-point arithmetic. Fixed-point arithmet ...

2013

Miniboxing: Improving the Speed to Code Size Tradeoff in Parametric Polymorphism Translations

Martin Odersky, Vlad Ureche, Cristian Talau

Parametric polymorphism enables code reuse and type safety. Underneath the uniform interface exposed to programmers, however, its low level implementation has to cope with inherently non-uniform data: value types of different sizes and semantics (bytes, in ...

2013

Thick Boundaries in Binary Space and Their Influence on Nearest-Neighbor Search

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski

Binary descriptors allow faster similarity computation than real-valued ones while requiring much less storage. As a result, many algorithms have recently been proposed to binarize ﬂoating-point descriptors so that they can be searched for quickly. Unfortu ...

Elsevier2012

Page 2 sur 3