Publication

Power spectra of random spike fields and related processes

Publications associées (41)

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

Sampling methods for parametric non-bandlimited signals

Irena Maravic

Sampling theory has experienced a strong research revival over the past decade, which led to a generalization of Shannon's original theory and development of more advanced formulations with immediate relevance to signal processing and communications. For e ...

EPFL2004

Power Spectra of UWB Time-hopping Modulated Signals: a Shot Noise Approach.

Andrea Ridolfi, Pierre Bremaud

This paper presents a general method for obtaining the exact power spectra of generic time hopping modulated signals. Based on a point process approach, it provides simpler proofs for existing results and a powerful rigorous and at the same time systematic ...

2004

Power Spectra of Spatial Hawkes Processes

Andrea Ridolfi, Pierre Bremaud

In this paper we derive the formula giving the spectrum of a spatial general linear birth and death process ...

2004

Sampling method, reconstruction method, and device for sampling and/or reconstructing signals

Martin Vetterli, Pina Marziliano, Thierry Blu

Reconstruction method for reconstructing a first signal (x(t)) regularly sampled at a sub-Nyquist rate, comprising the step of retrieving from the regularly spaced sampled values (ys[n], y(nT)) a set of weights (cn, cnr, ck) and shifts (tn, tk) with which ...

2003

Sampling innovations

Pina Marziliano

Sampling theory has prospered extensively in the last century. The elegant mathematics and the vast number of applications are the reasons for its popularity. The applications involved in this thesis are in signal processing and communications and call out ...

EPFL2002

Sampling signals with finite rate of innovation

Martin Vetterli, Pina Marziliano, Thierry Blu

Consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform ...

Institute of Electrical and Electronics Engineers2002

Sampling signals with finite rate of innovation: the noisy case

Martin Vetterli, Andrea Ridolfi, Irena Maravic

Recently a sampling theorem for a certain class of signals with finite rate of innovation (which includes for example stream of Diracs) has been developed. In essence, such non band-limited signals can be sampled at or above the rate of innovation. In the ...

2002

Stochastic Bound on Delay for Guaranteed Rate Nodes

Jean-Yves Le Boudec, Milan Vojnovic

We find that the probabilistic bound on delay in the article by Goyal et al. in 1997 is incorrect. The problem originates from: 1) the difference between stationary and Palm probabilities and 2) treating the arrival counting process over some random time i ...

2002

Stochastic Bound on Delay for Guaranteed Rate Nodes

Jean-Yves Le Boudec, Milan Vojnovic

We find that the probabilistic bound on delay in [1] is incorrect. The problem originates from: (1) the difference between stationary and Palm probabilities, and (2) treating the arrival counting process over some random time intervals as if the time inter ...

2002

Analysis of random processes via AND/OR tree evaluations

Mohammad Amin Shokrollahi

We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework for carrying out the analysis of several previously studied random processes ...

1998