Concept

Fixed-point arithmetic

Related publications (131)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

STEP-NC compliant process planning of additive manufacturing: remanufacturing

Ian Anthony Stroud, Jumyung Um

Additive manufacturing is becoming one of the key methods for reproducing repair sections in remanufacturing processes. The major advantage of using additive processes is to minimize production time and waste. However, the surface quality and shape accurac ...

Springer London Ltd2017

Secure numerical and logical multi party operations

Bin Lu

We derive algorithms for efficient secure numerical and logical operations in the semi-honest model ensuring statistical or perfect security for secure multi-party computation (MPC). To derive our algorithms for trigonometric functions, we use basic mathem ...

Elsevier Science Bv2017

Hierarchical Reversible Logic Synthesis Using LUTs

Giovanni De Micheli, Mathias Soeken

Today's rapid advances in the physical implementation of quantum computers demand for scalable synthesis methods in order to map practical logic designs to quantum architectures. We present a synthesis algorithm for quantum computing based on k-LUT network ...

IEEE2017

A semi-algebraic version of Zarankiewicz's problem

János Pach

A bipartite graph G is semi-algebraic in R-d if its vertices are represented by point sets P,Q subset of R-d and its edges are defined as pairs of points (p,q) epsilon P x Q that satisfy a Boolean combination of a fixed number of polynomial equations and i ...

European Mathematical Soc2017

Compute-forward multiple access (CFMA) with nested LDPC codes

Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu, Erixhen Sula, Adriano Pastore

Inspired by the compute-and-forward scheme from Nazer and Gastpar, a novel multiple-access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and sequential decoding of linear combinations of codewords to recover the individual messages ...

2017

Decomposition of a Cube into Nearly Equal Smaller Cubes

János Pach

Let d be a fixed positive integer and let epsilon > 0. It is shown that for every sufficiently large n >= n(0)( d, e), the d-dimensional unit cube can be decomposed into exactly n smaller cubes such that the ratio of the side length of the largest cube to ...

Mathematical Assoc Amer2017

The dam-break problem for eroding viscoplastic fluids.

Christophe Ancey, Belinda Margaret Bates

Natural gravity-driven flows can increase in volume by eroding the bed on which they descend. This process is called basal entrainment and is thought to play a key role in the bulk dynamics of geophysical flows. Although its study is difficult using field ...

Elsevier2017

Point and sensor estimation from images

Martin Vetterli, Adam James Scholefield, Alireza Ghasemi

System comprising at least one sensor configured to take a set of images from different viewpoints of a scene; a processor configured to identifying a point source represented in the images of a set of images; computing for each image of the set of images ...

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