Concept

Fonction de Walsh

Publications associées (25)

Multiquadratic Rings and Walsh-Hadamard Transforms for Oblivious Linear Function Evaluation

The Ring Learning with Errors (RLWE) problem has become one of the most widely used cryptographic assumptions for the construction of modern cryptographic primitives. Most of these solutions make use of power-of-two cyclotomic rings mainly due to its simpl ...

IEEE2020

Signal Analysis Based on Complex Wavelet Signs

Martin Kurt Storath

We propose a signal analysis tool based on the sign (or the phase) of complex wavelet coefficients, which we call a signature. The signature is defined as the fine-scale limit of the signs of a signal's complex wavelet coefficients. We show that the signat ...

Elsevier2017

Rake, Peel, Sketch

Robin Scheibler

The prototypical signal processing pipeline can be divided into four blocks. Representation of the signal in a basis suitable for processing. Enhancement of the meaningful part of the signal and noise reduction. Estimation of important statistical properti ...

EPFL2017

Optimized Wavelet Denoising for Self-Similar alpha-Stable Processes

Michaël Unser, Pedram Pad

We investigate the performance of wavelet shrinkage methods for the denoising of symmetric-a-stable (S alpha S) self-similar stochastic processes corrupted by additive white Gaussian noise (AWGN), where a is tied to the sparsity of the process. The wavelet ...

2017

Polarization of the Renyi Information Dimension With Applications to Compressed Sensing

Emmanuel Abbé, Saeid Haghighatshoar

In this paper, we show that the Hadamard matrix acts as an extractor over the reals of the Renyi Information Dimension (RID), in an analogous way to how it acts as an extractor of the discrete entropy over finite fields. More precisely, we prove that the R ...

Ieee-Inst Electrical Electronics Engineers Inc2017

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

In this paper, we design a new iterative low-complexity algorithm for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT. We suppose that N is a power of two and K = O(N^α), scales sub-linearly in N for some α ∈ (0, ...

Institute of Electrical and Electronics Engineers2015

Method for determining the walsh-hadamard transform of n samples of a signal and apparatus for performing the same

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A computer-implemented method for determining the Walsh-Hadamard transform of N samples of a signal, comprises electing a plurality of hashing C matrices Σ1, . . . ΣC, computing C hashes of a particular length based at least on a hashing front end and the ...

2015

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT, where N is a power of two and K = O(N^α), scales sub- linearly in N for some 0 < α < 1. Assuming a ...

2013

Fast continuous Fourier and Haar transforms of rectilinear polygons from very-large-scale integration layouts

Paul Hurley, Robin Scheibler, Amina Chebira

We propose two new fast algorithms for the computation of the continuous Fourier series and the continuous Haar transform of rectilinear polygons such as those of mask layouts in optical lithography. These algorithms outperform their discrete counterparts ...

2013

On The Optimality Of Operator-Like Wavelets For Sparse Ar(1) Processes

Michaël Unser, Pedram Pad

Sinusoidal transforms such as the DCT are known to be optimal-that is, asymptotically equivalent to the Karhunen-Loeve transform (KLT)-for the representation of Gaussian stationary processes, including the classical AR(1) processes. While the KLT remains a ...

Ieee2013

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search