Publications related to Fixed-point arithmetic

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

In this paper we propose a binary field variant of the Joux-Lercier medium-sized Function Field Sieve, which results not only in complexities as low as

L_{q^n}(1/3,(4/9)1/3)

for computing arbitrary logarithms, but also in an heuristic polynomial time alg ...

Springer Berlin Heidelberg2013

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Rüdiger Urbanke, Seyed Hamed Hassani

Polar codes provably achieve the capacity of a wide array of channels under successive decoding. This assumes infinite precision arithmetic. Given the successive nature of the decoding algorithm, one might worry about the sensitivity of the performance to ...

Ieee2012

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Rüdiger Urbanke, Seyed Hamed Hassani

Polar codes provably achieve the capacity of a wide array of channels under successive decoding. This assumes infinite precision arithmetic. Given the successive nature of the decoding algorithm, one might worry about the sensitivity of the performance to ...

2012

Data Mapping for Unreliable Memories

Andreas Peter Burg, Georgios Karakonstantis, Christoph Studer

Future digital signal processing (DSP) systems must provide robustness on algorithm and application level to the presence of reliability issues that come along with corresponding implementations in modern semiconductor process technologies. In this paper, ...

2012

Synthesis of uniform amplitude focused beam arrays

Juan Ramon Mosig, Anja Skrivervik, Benjamin Fuchs

An iterative procedure for the synthesis of uniform amplitude focused beam arrays is presented. Specifically, the goal is to optimize the locations of a fixed number of array elements with known excitations in order to synthesize narrow-beam low-sidelobe p ...

2012

Vectors in a box

Doemoetoer Palvoelgyi

For an integer d a parts per thousand yen 1, let tau(d) be the smallest integer with the following property: if v (1), v (2), . . . , v (t) is a sequence of t a parts per thousand yen 2 vectors in [-1, 1] (d) with , then there is a set of indices, 2 a part ...

Springer2012

Fast O(1) Bilateral Filtering Using Trigonometric Range Kernels

Michaël Unser, Daniel Sage, Kunal Narayan Chaudhury

It is well known that spatial averaging can be realized (in space or frequency domain) using algorithms whose complexity does not scale with the size or shape of the filter. These fast algorithms are generally referred to as constant-time or O(1) algorithm ...

IEEE2011

Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers

János Pach, Gábor Tardos

It is an old problem of Danzer and Rogers to decide whether it is possible arrange O(1/epsilon) points in the unit square so that every rectangle of area epsilon contains at least one of them. We show that the answer to this question is in the negative if ...

Springer-Verlag Berlin2011

RRB-Trees: Efficient Immutable Vectors

Tiark Rompf

Immutable vectors are a convenient data structure for functional programming and part of the standard library of modern languages like Clojure and Scala. The common implementation is based on wide trees with a fixed number of children per node, which allow ...

2011

HW-SW Implementation of a Decoupled FPU for ARM-based Cortex-M1 SoCs in FPGAs

Giovanni De Micheli, Jaime Joven Murillo

Nowadays industrial monoprocessor and multipro- cessor systems make use of hardware floating-point units (FPUs) to provide software acceleration and better precision due to the necessity to compute complex software applications. This paper presents the des ...

2011

Fixed-point arithmetic

Graph Chatbot

Chat with Graph Search

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Data Mapping for Unreliable Memories

Synthesis of uniform amplitude focused beam arrays

Vectors in a box

Fast O(1) Bilateral Filtering Using Trigonometric Range Kernels

Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers

RRB-Trees: Efficient Immutable Vectors

HW-SW Implementation of a Decoupled FPU for ARM-based Cortex-M1 SoCs in FPGAs

Fast O(1) Bilateral Filtering Using Trigonometric Range Kernels

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

Synthesis of uniform amplitude focused beam arrays

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Data Mapping for Unreliable Memories

Vectors in a box

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers

RRB-Trees: Efficient Immutable Vectors

HW-SW Implementation of a Decoupled FPU for ARM-based Cortex-M1 SoCs in FPGAs