Concept

Matched filter

Related publications (32)

Efficient processing and detection of balanced codes

Mohammad Amin Shokrollahi, Seyed Armin Tajalli, Harm Cronie

Circuits that are matched to balanced codes may recover transmitted information in a noise resilient and power efficient manner. Circuit components for processing a balanced code may include one or more of: matched amplification of the signals representing ...

2013

Accuracy and Stability of The Continuous-Time 3DVAR Filter for The Navier-Stokes Equation

The 3DVAR filter is prototypical of methods used to combine observed data with a dynamical system, online, in order to improve estimation of the state of the system. Such methods are used for high dimensional data assimilation problems, such as those arisi ...

2012

Doubly sparse models for multiple filter estimation in sparse echoic environments

Pierre Vandergheynst, Rémi Gribonval

We consider the estimation of multiple time-domain sparse filters from echoic mixtures of several unknown sources, when the sources are sparse in the time-frequency domain. We propose a sparse filter estimation framework consisting of two steps: a) a clust ...

2012

Estimating multiple filters from stereo mixtures: a double sparsity approach

Rémi Gribonval

We consider the problem of estimating multiple filters from convolutive mixtures of several unknown sources. We propose to exploit both the time-frequency (TF) sparsity of the sources and the sparsity of the mixing filters. Our framework consists of: a) a ...

2011

Probability distribution of steady-state errors and adaptation over networks

Ali H. Sayed

In this work, we derive a near-optimal combination rule for adaptation over networks. To do so, we first establish a useful result pertaining to the steady-state distribution of the estimator of an LMS filter. Specifically, under small step-sizes and some ...

IEEE2011

Maximum-Likelihood Identification of Sampled Gaussian Processes

Michaël Unser, Hagay Kirshner, Simona Maggio

This work considers sampled data of continuous-domain Gaussian processes. We derive a maximum-likelihood estimator for identifying autoregressive moving average parameters while incorporating the sampling process into the problem formulation. The proposed ...

SampTA2011

A Musically Motivated Mid-Level Representation for Pitch Estimation and Musical Audio Source Separation

When designing an audio processing system, the target tasks often influence the choice of a data representation or transformation. Low-level time-frequency representations such as the short-time Fourier transform (STFT) are popular, because they offer a me ...

2011

Learning Sparse Systems at Sub-Nyquist Rates: A Frequency-Domain Approach

Martin Vetterli, Yue Lu

We propose a novel algorithm for sparse system identification in the frequency domain. Key to our result is the observation that the Fourier transform of the sparse impulse response is a simple sum of complex exponentials, whose parameters can be efficient ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

CMOS Compressed Imaging by Random Convolution

Pierre Vandergheynst, Alexandre Schmid, Yusuf Leblebici, Laurent Jacques, Vahid Majidzadeh Bafar

We present a CMOS imager with built-in capability to perform Compressed Sensing. The adopted sensing strategy is the random Convolution due to J. Romberg. It is achieved by a shift register set in a pseudo-random configuration. It acts as a convolutive fil ...

2009

CMOS Compressed Imaging by Random Convolution

Pierre Vandergheynst, Alexandre Schmid, Yusuf Leblebici, Laurent Jacques, Vahid Majidzadeh Bafar

2009

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.