Publication

On the necessary density for spectrum-blind nonuniform sampling

Related publications (14)

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.

Particle number control for direct simulation Monte-Carlo methodology using kernel estimates

The efficiency of stochastic particle schemes for large scale simulations relies on the ability to preserve a uniform distribution of particles in the whole physical domain. While simple particle split and merge algorithms have been considered previously, ...

2019

Towards Generalized FRI Sampling with an Application to Source Resolution in Radioastronomy

Martin Vetterli, Thierry Blu, Hanjie Pan

It is a classic problem to estimate continuous-time sparse signals, like point sources in a direction-of-arrival problem, or pulses in a time-of-flight measurement. The earliest occurrence is the estimation of sinusoids in time series using Prony's method. ...

Institute of Electrical and Electronics Engineers2017

On the Unique Identification of Continuous-Time Autoregressive Models From Sampled Data

Michaël Unser, John Paul Ward, Hagay Kirshner

In this work, we investigate the relationship between continuous-time autoregressive (AR) models and their sampled version. We consider uniform sampling and derive criteria for uniquely determining the continuous-time parameters from sampled data; the mode ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

We consider the previously unsolved problem of sampling paths according to a given distribution from a general network. The problem is difficult because of the combinatorial number of alternatives, which prohibits a complete enumeration of all paths and he ...

2013

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

2011

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

2011

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

We consider the previously unsolved problem of sampling cycle-free paths according to a given distribution from a general network. The problem is difficult because of the combinatorial number of alternatives, which prohibits a complete enumeration of all p ...

2011

A Sampling Theory Approach for Continuous ARMA Identification

Michaël Unser, Hagay Kirshner, Simona Maggio

The problem of estimating continuous-domain autoregressive moving-average processes from sampled data is considered. The proposed approach incorporates the sampling process into the problem formulation while introducing exponential models for both the cont ...

IEEE2011

SHOCK IMPACT OF HIGH ENERGY/INTENSITY BEAMS WITH MATTER AND HIGH ENERGY DENSITY PHYSICS

Juan Blanco Sancho, Rudiger Schmidt

The purpose of this study is to assess the damage caused to the equipment (beamdump, collimators etc) in case of an accident involving full impact of the LHC beam. First, the FLUKA code [1] is used to calculate the proton energy loss in solid carbon and th ...

2010

Inclusion of an automatic adaptive sampling method in NEC

Abraham Rubinstein

As sampling is taking place, the most active regions of the spectrum can be identified (i.e. the vicinity of spectral peaks). By selectively increasing the spectral density within those regions improves the quality of the total spectral representation redu ...

2005