Publication
Towards General-Purpose Decentralized Computing with Permissionless Extensibility
Publications associées (46)
Proof-of-Personhood: Redemocratizing Permissionless Cryptocurrencies
Bryan Alexander Ford, Linus Gasser, Eleftherios Kokoris Kogias, Philipp Svetolik Jovanovic, Nicolas Gailly, Maria Fernanda Borge Chavez
Permissionless blockchain-based cryptocurrencies commonly use proof-of-work (PoW) or proof-of-stake (PoS) to ensure their security, e.g. to prevent double spending attacks. However, both approaches have disadvantages: PoW leads to massive amounts of wasted ...
IEEE2017A 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 ...
Ieee2016Approximate 32-Bit Floating-Point Unit Design with 53% Power-Area Product Reduction
Christian Enz, Vincent Frédéric Camus, Jérémy Lucien Maurice Schlachter
The floating-point unit is one of the most common building block in any computing system and is used for a huge number of applications. By combining two state-of-the-art techniques of imprecise hardware, namely Gate-Level Pruning and Inexact Speculative Ad ...
Ieee2016On Numerical Error Propagation with Sensitivity
An emerging area of research is to automatically compute reasonably accurate upper bounds on numerical errors, including roundoffs due to the use of a finite-precision representation for real numbers such as floating point or fixed-point arithmetic. Previo ...
2014On the use of inexact, pruned hardware in atmospheric modelling
Giovanni De Micheli, Jaime Joven Murillo, Avinash Lingamneni
Inexact hardware design, which advocates trading the accuracy of computations in exchange for significant savings in area, power and/or performance of computing hardware, has received increasing prominence in several error-tolerant application domains, par ...
Royal Soc2014Programming with Numerical Uncertainties
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 ...
EPFL2014Block-Floating-Point Enhanced MMSE Filter Matrix Computation for MIMO-OFDM Communication Systems
Andreas Peter Burg, Carl Christian Sten Dominic Senning
n this paper we present an architecture for an MMSE filter matrix computation unit for signal detection in MIMO-OFDM communication systems. We propose to compute the required matrix inverse based on a Cholesky decomposition, followed by a Gauss-Jordan matri ...
2013Multi-dimensional hybrid Fourier continuation-WENO solvers for conservation laws
We introduce a multi-dimensional point-wise multi-domain hybrid Fourier-Continuation/WENO technique (FC-WENO) that enables high-order and non-oscillatory solution of systems of nonlinear conservation laws, and essentially dispersionless, spectral, solution ...
Elsevier2013BRIEF: Computing a Local Binary Descriptor Very Fast
Pascal Fua, Vincent Lepetit, Christoph Strecha, Michael Calonder, Tomasz Piotr Trzcinski, Mustafa Özuysal
Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach to creating them is to first compute floating-point ones, using an algorithm ...
Institute of Electrical and Electronics Engineers2012Thick 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 floating-point descriptors so that they can be searched for quickly. Unfortu ...
Elsevier2012