Publication

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

Related publications (76)

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.

Coding schemes for broadcast erasure channels with feedback: the two multicast case

Christina Fragouli, Efe Onaran

We consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of

N

users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent ...

2013

Generator coherency identification algorithm using modal and time-domain information

Maher Kayal, Theodoros Kyriakidis

Coherency group identification is an integral constituent part of the wider field of reduction techniques in power systems. It consists of separating the machines in the system into groups that feature similar behavior. This paper presents a coherency iden ...

IEEE2013

, ,

This paper introduces a novel algorithm for sparse approximation in redundant dictionaries called the M-term pursuit (MTP). This algorithm decomposes a signal into a linear combination of atoms that are selected in order to represent the main signal compon ...

Institute of Electrical and Electronics Engineers2012

d-Transversals of stable sets and vertex covers in weighted bipartite graphs

Dominique de Werra, Bernard Ries

Let G=(V,E)G=(V,E) be a graph in which every vertex v∈Vv∈V has a weight w(v)⩾0w(v)⩾0 and a cost c(v)⩾0c(v)⩾0. Let SGSG be the family of all maximum-weight stable sets in G . For any integer d⩾0d⩾0, a minimum d-transversal in the graph G with respect to SGS ...

2012

The classical approach to sampling time-invariant spatial fields uses static sensors distributed over space. We study a new approach involving mobile sensors that move through space measuring the field values along their paths. A single moving sensor can t ...

Ieee2012

A novel sampling theorem on the sphere

Yves Wiaux, Jason Douglas McEwen

We develop a novel sampling theorem on the sphere and corresponding fast algorithms by associating the sphere with the torus through a periodic extension. The fundamental property of any sampling theorem is the number of samples required to represent a ban ...

Institute of Electrical and Electronics Engineers2011

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

Multichannel Sampling with Unknown Gains and Offsets: A Fast Reconstruction Algorithm

Martin Vetterli, Yue Lu

We study a multichannel sampling scheme, where different channels observe scaled and shifted versions of a common bandlimited signal. The channel gains and offsets are unknown a priori, and each channel samples at sub-Nyquist rates. This setup appears in m ...

2010

Comparison of time and frequency domain interpolation implementations for MB-OFDM UWB transmitters

This paper investigates the effect of time-domain (TD) and frequency-domain (FD) interpolation on the performance of a Multi-Band (MB) Orthogonal Frequency Division Multiplexing (OFDM) Ultra-Wideband (UWB) system. We introduce a FD interpolator implemented ...

2010

Pruned Continuous Haar Transform of 2D Polygonal Patterns with Application to VLSI Layouts

Paul Hurley, Robin Scheibler, Amina Chebira

We introduce an algorithm for the efﬁcient computation of the continuous Haar transform of 2D patterns that can be described by polygons. These patterns are ubiquitous in VLSI processes where they are used to describe design and mask layouts. There speed i ...

2010

Coding schemes for broadcast erasure channels with feedback: the two multicast case

Christina Fragouli, Efe Onaran

We consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of

N

users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent ...

2013