Concept

Hadamard matrix

Related publications (17)

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

Simultaneous Vehicle Crossing Effects on Fatigue Damage Equivalence Factors for North American Roadway Bridges

Alain Nussbaumer, Scott Walbridge, Nariman Maddah, Vincent Fischer

In many design codes for roadway bridges, fatigue design involves passing a load model over an influence line for a critical location on the bridge and then determining the resulting nominal stress range. For fatigue design in the finite-life domain, this ...

American Society of Civil Engineers2013

Adaptive sensing using deterministic partial Hadamard matrices

Emre Telatar, Emmanuel Abbé, Saeid Haghighatshoar

This paper investigates the construction of determin- istic measurement matrices preserving the entropy of a random vector with a given probability distribution. In particular, it is shown that for a random vector with i.i.d. discrete components, this is a ...

Ieee2012

Sampling of Sparse Channels with Common Support

Martin Vetterli, Ali Hormati, Yann Barbotin

The present paper proposes and studies an algorithm to estimate chan- nels with a sparse common support (SCS). It is a generalization of the classical sampling of signals with Finite Rate of Innovation (FRI) and thus called SCS-FRI. It is applicable to OFD ...

2011

Recognition of generalized network matrices

Antoine Musitelli

In this thesis, we deal with binet matrices, an extension of network matrices. The main result of this thesis is the following. A rational matrix A of size n×m can be tested for being binet in time O(n6m). If A is binet, our algorithm outputs a nonsingular ...

EPFL2007

Resamping variance estimation in surveys with missing data

Anthony Christopher Davison

We discuss variance estimation by resampling in surveys in which data are missing. We derive a formula for jackknife linearization in the case of calibrated estimation with deterministic regression imputation, and compare the resulting variance estimates w ...

2007

Tree structures for orthogonal transform and application to the Hadamard transform

Martin Vetterli

Tree structures for computing orthogonal transforms are introduced. Two cases, delay trees and decimation trees, are investigated. A simple condition, namely the orthogonality of branches with a common root, is shown to be necessary and sufficient for the ...

1983

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.